Analysis of locking policies in database management systems
Communications of the ACM
Approximating block accesses in database organizations
Communications of the ACM
A stochastic evaluation model for database organizations in data retrieval systems
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
Limitations of concurrency in transaction processing
ACM Transactions on Database Systems (TODS)
A Recursive Solution Method to Analyze the Performance of Static Locking Systems
IEEE Transactions on Software Engineering
Analysis of database performance with dynamic locking
Journal of the ACM (JACM)
Modeling hot spots in database systems (extended abstract)
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Performance Analysis of Two-Phase Locking
IEEE Transactions on Software Engineering
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
Estimating block transfers and join sizes
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Determining the Number of Remote Sites Accessed in Distributed Transaction Processing
IEEE Transactions on Parallel and Distributed Systems
Hash-Based Join Algorithms for Multiprocessor Computers
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Performance Analysis of Concurrency Control Methods
Performance Evaluation: Origins and Directions
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
A simple analysis of exclusive and shared lock contention in a database system
SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems
| Hi-index | 48.22 |
The problem of characterizing the number of granules (or blocks) accessed by a transaction is important in modeling the performance of database management systems and other applications. Different expressions for this quantity have appeared in the literature under different probabilistic assumptions. These expressions along with one new result are presented with a uniform notation and a clear statement of the assumptions underlying each. The partial order relating the predictions of the expected number of granules accessed is presented.