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
Modular synchronization in multiversion databases: version control and concurrency control
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
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)
Distributed database concurrency controls using before-values
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
The implementation of an integrated concurrency control and recovery scheme
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
On Mixing Queries and Transactions via Multiversion Locking
Proceedings of the Eighth International Conference on Data Engineering
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Multiversion divergence control of time fuzziness
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Performance Analysis of Dynamic Finite Versioning Schemes: Storage Cost vs. Obsolescence
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the first joint WOSP/SIPEW international conference on Performance engineering
| Hi-index | 0.00 |
In this paper, we analyze the performance of dynamic finite versioning (DFV) schemes for concurrent transaction and query processing, where a finite number of consistent snapshots can be derived for query access. We develop analytical models based on a renewal process approximation to evaluate the performance of DFV using M ≥ 2 snapshots. The storage overhead and obsolescence faced by queries are measured. Simulation is used to validate the analytical models and to evaluate the trade-offs between various starategies for advancing snapshots when M 2.The results show that (1) the analytical models match closely with simulation; 2) both the storage overhead 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 2 can substantially reduce the obsolescence, while the storage overhead may increase only slightly, or even decrease in some cases. Moreover, for very low update rates, a large 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 2 can substantially reduce the obsolescence, while the storage overhead may increase only slightly, or even decrease in some cases. 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.