Distributed databases principles and systems
Distributed databases principles and systems
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Models for studying concurrency control performance: alternatives and implications
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Consistency in Hierarchical Database Systems
Journal of the ACM (JACM)
Deadlock-freedom (and saftey) of transactions in a distributed database
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
The inherent cost of nonblocking commitment
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
SimDS: a simulation environment for the design of distributed database systems
ACM SIGMIS Database
Towards a new distributed programming environment (CORDS)
CASCON '91 Proceedings of the 1991 conference of the Centre for Advanced Studies on Collaborative research
Efficiently maintaining consistency using tree-based p2p network system in distributed network games
Edutainment'06 Proceedings of the First international conference on Technologies for E-Learning and Digital Entertainment
| Hi-index | 0.00 |
The main purpose of a locking protocol is to ensure correct interleaving of actions executed by concurrent transactions. The locking protocol consists of a set of rules dictating how accessed entities should be locked and unlocked. As a result of obeying the rules, transactions in a distributed database incur an overhead. We propose three measures of evaluating this overhead, each most suitable to a different type of underlying communication network. Then, using a graph theoretic model, we analyze and compare three protocols according to each measure: two-phase locking, two-phase locking with a fixed order imposed on the database entities (ensuring deadlock freedom), and the tree protocol. In practice, a transaction also executes the two-phase commit protocol in order to guarantee atomicity. Therefore, the combined overhead of each locking protocol and the two-phase commit protocol is also determined.