System R: relational approach to database management
ACM Transactions on Database Systems (TODS)
Effects of locking granularity in a database management system
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Approximating block accesses in database organizations
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
Deadlock detection and resolution in a CODASYL based data management system
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
Concurrency in database systems: a simulation study
SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
Performance prototyping of data management applications
ACM '76 Proceedings of the 1976 annual conference
Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics
Journal of the ACM (JACM)
A mean value performance model for locking in databases: the no-waiting case
Journal of the ACM (JACM)
The performance of multiversion concurrency control algorithms
ACM Transactions on Computer Systems (TOCS)
Concurrency control performance modeling: alternatives and implications
ACM Transactions on Database Systems (TODS)
A Queueing Network Model for a Distributed Database Testbed System
IEEE Transactions on Software Engineering
The Delay Due to Dynamic Two-Phase Locking
IEEE Transactions on Software Engineering
Analysis of database performance with dynamic locking
Journal of the ACM (JACM)
The Starburst long field manager
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Modeling distributed file systems
ACM SIGMETRICS Performance Evaluation Review
Adaptive transaction scheduling
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Quasi-dynamic two-phase locking
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Models for studying concurrency control performance: alternatives and implications
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
A fast general-purpose hardware synchronization mechanism
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Genesis: a distributed database operating system
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
Retrospection on a database system
ACM Transactions on Database Systems (TODS)
Performance analysis of dynamic locking
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
CARAT: a testbed for the performance evaluation of distributed database systems
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
A Survey of Techniques for Synchronization and Recovery in Decentralized Computer Systems
ACM Computing Surveys (CSUR)
Analysis of locking policies in database management systems
Communications of the ACM
An abstract model of database concurrency control algorithms
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
An experimental comparison of locking policies in a testbed database system
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Granularity hierarchies in concurrency control
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
A methodology for database system performance evaluation
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A New Methodology to Evaluate Locking Protocols
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of a Concurrent File Reorganization Algorithm for Record Clustering
IEEE Transactions on Knowledge and Data Engineering
A Multi-Granularity Locking Model for Concurrency Control in Object-Oriented Database Systems
IEEE Transactions on Knowledge and Data Engineering
On Coupling Multiple Systems With A Global Buffer
IEEE Transactions on Knowledge and Data Engineering
Optimal Design of Multiple Hash Tables for Concurrency Control
IEEE Transactions on Knowledge and Data Engineering
The Performance of Concurrency Control Algorithms for Database Management Systems
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
A Quantitative Comparison of Lockprotocols for Centralized Databases
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Empirical Comparison of Database Concurrency Schemes
VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Analysis of locking behavior in three real database systems
The VLDB Journal — The International Journal on Very Large Data Bases
A decomposition solution to the queueing network model of the centralized DBMS with static locking
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Concurrency control and integrity preservation for the `RIM' DBMS
ACM SIGMIS Database
A survey of techniques for the modeling of serialization delays in computer systems
ACM SIGMETRICS Performance Evaluation Review
A formal approach to lock escalation
Information Systems
Data base system performance prediction using an analytical model (invited paper)
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering
Multiversion repeatable read isolation level: theory and practice
ACST '08 Proceedings of the Fourth IASTED International Conference on Advances in Computer Science and Technology
Modelling parallel access to shared resources in a distributed file system using queueing networks
Journal of Systems and Software
Hi-index | 0.02 |
Locking granularity refers to the size and hence the number of locks used to ensure the consistency of a database during multiple concurrent updates. In an earlier simulation study we concluded that coarse granularity, such as area or file locking, is to be preferred to fine granularity such as individual page or record locking.However, alternate assumptions than those used in the original paper can change that conclusion. First, we modified the assumptions concerning the placement of the locks on the database with respect to the accessing transactions. In the original model the locks were assumed to be well placed. Under worse case and random placement assumptions when only very small transactions access the database, fine granularity is preferable.Second, we extended the simulation to model a lock hierarchy where large transactions use large locks and small transactions use small locks. In this scenario, again under the random and worse case lock placement assumptions, fine granularity is preferable if all transactions accessing more than 1 percent of the database use large locks.Finally, the simulation was extended to model a “claim as needed” locking strategy together with the resultant possibility of deadlock. In the original study all locks were claimed in one atomic operation at the beginning of a transaction. The claim as needed strategy does not change the conclusions concerning the desired granularity.