A probabilistic analysis of a database system
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Performance analysis of an algorithm for concurrency control in replicated database systems
SIGMETRICS '86/PERFORMANCE '86 Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation
Sequentiality and prefetching in database systems
ACM Transactions on Database Systems (TODS)
On the modeling of parallel access to shared data
Communications of the ACM
Analysis of locking policies in database management systems
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
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
| Hi-index | 0.98 |
In this paper, we present an analysis of transaction blocking under arbitrary data access distribution to assist the performance analysis of concurrency control algorithms and frequency of deadlocks under arbitrary data access distribution. We present an efficient algorithm for computation of probability of conflicts among transactions for databases where data access distribution is arbitrary. We extend the result to the environments of dynamic lock acquisition policy which permits the performance analysis of dynamic locking algorithms and analysis of the frequency of deadlocks in the environments of arbitrary data access distribution. We illustrate the technique by taking a numerical example and show that the assumption of uniform data access distribution can introduce significant error.