File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: PRECEDENCE-ASSIGNMENT MODEL FOR DISTRIBUTED DATABASE CONCURRENCY CONTROL ALGORITHMS.

TitlePRECEDENCE-ASSIGNMENT MODEL FOR DISTRIBUTED DATABASE CONCURRENCY CONTROL ALGORITHMS.
Authors
Wang, CPLi, VOK
Issue Date1987
Citation
Proceedings of the 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, San Diego, CA., 23-25 March 1987. How to Cite?
AbstractWe have developed a unified model, called the precedence-assignment model (PAM), of concurrency control algorithms in distributed database. It is shown that two-phase locking, timestamp-ordering and other existing concurrency control algorithms may be modeled by PAM. We have also developed a new concurrency control algorithm under the PAM modeling framework, which is free from deadlocks and transaction restarts. Finally, a unified concurrency control subsystem for precedence-assignment algorithms is developed. By using this subsystem, different transactions may be executed under different concurrency control algorithms simultaneously.
Persistent Identifierhttp://hdl.handle.net/10722/158024

 

DC FieldValueLanguage
dc.contributor.authorWang, CPen_US
dc.contributor.authorLi, VOKen_US
dc.date.accessioned2012-08-08T08:57:46Z-
dc.date.available2012-08-08T08:57:46Z-
dc.date.issued1987en_US
dc.identifier.citationProceedings of the 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, San Diego, CA., 23-25 March 1987.-
dc.identifier.urihttp://hdl.handle.net/10722/158024-
dc.description.abstractWe have developed a unified model, called the precedence-assignment model (PAM), of concurrency control algorithms in distributed database. It is shown that two-phase locking, timestamp-ordering and other existing concurrency control algorithms may be modeled by PAM. We have also developed a new concurrency control algorithm under the PAM modeling framework, which is free from deadlocks and transaction restarts. Finally, a unified concurrency control subsystem for precedence-assignment algorithms is developed. By using this subsystem, different transactions may be executed under different concurrency control algorithms simultaneously.en_US
dc.languageengen_US
dc.relation.ispartofProceedings of the 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems-
dc.titlePRECEDENCE-ASSIGNMENT MODEL FOR DISTRIBUTED DATABASE CONCURRENCY CONTROL ALGORITHMS.en_US
dc.typeConference_Paperen_US
dc.identifier.emailLi, VOK: vli@eee.hku.hken_US
dc.identifier.authorityLi, VOK=rp00150en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.scopuseid_2-s2.0-0023560941en_US
dc.identifier.scopusauthoridWang, CP=7501629318en_US
dc.identifier.scopusauthoridLi, Victor OK=7202621685en_US
dc.customcontrol.immutablesml 160114 - amend-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats