Principles of transaction-oriented database recovery
ACM Computing Surveys (CSUR)
The performance of multiversion concurrency control algorithms
ACM Transactions on Computer Systems (TOCS)
Distributed Version Management for Read-Only Actions
IEEE Transactions on Software Engineering - Special issue on distributed systems
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Performance evaluation of global reading of entire databases
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Modular synchronization in multiversion databases: version control and concurrency control
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Replica control in distributed systems: as asynchronous approach
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Performance analysis of dynamic finite versioning for concurrent transaction and query processing
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Parallelism in relational data base systems: architectural issues and design approaches
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Multiversion concurrency control—theory and algorithms
ACM Transactions on Database Systems (TODS)
Parallelism and recovery in database systems
ACM Transactions on Database Systems (TODS)
Implementing atomic actions on decentralized data
ACM Transactions on Computer Systems (TOCS)
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
The implementation of an integrated concurrency control and recovery scheme
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Divergence Control for Epsilon-Serializability
Proceedings of the Eighth International Conference on Data Engineering
On Mixing Queries and Transactions via Multiversion Locking
Proceedings of the Eighth International Conference on Data Engineering
Proceedings of the Ninth International Conference on Data Engineering
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Performance Analysis of Concurrency Control Methods
Performance Evaluation: Origins and Directions
ADMiRe: An Algebraic Data Mining Approach to System Performance Analysis
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering
| Hi-index | 0.00 |
Dynamic finite versioning (DFV) schemes are an effective approach to concurrent transaction and query processing, where a finite number of consistent, but maybe slightly out-of-date, logical snapshots of the database can be dynamically derived for query access. In DFV, the storage overhead for keeping additional versions of changed data to support the logical snapshots and the amount of obsolescence faced by queries are two major performance issues. In this paper, we analyze the performance of DFV, with emphasis on the trade-offs between the storage cost and obsolescence. We develop analytical models based on a renewal-process approximation to evaluate the performance of DFV using M驴 2 snapshots. Asymptotic closed-form results for high query arrival rates are given for the case of two snapshots. Simulation is used to validate the analytical models and to evaluate the trade-offs between various strategies for advancing snapshots when M 2. The results show that 1) the analytical models match closely with simulation; 2) both the storage cost and obsolescence are sensitive to the snapshot-advancing strategies, especially for M 2 snapshots; and 3) generally speaking, increasing the number of snapshots demonstrates a trade-off between storage overhead and query obsolescence. For cases with skewed access or low update rates, a moderate increase in the number of snapshots beyond two can substantially reduce the obsolescence, while the storage overhead may increase only slightly, or even decrease in some cases. Such a reduction in obsolescence is more significant as the coefficient of variation of the query length distribution becomes larger. Moreover, for very low update rates, a large number of snapshots can be used to reduce the obsolescence to almost zero without increasing the storage overhead.