Highly available systems for database applications
ACM Computing Surveys (CSUR)
Read-only transactions in a distributed database
ACM Transactions on Database Systems (TODS)
Parallelism and recovery in database systems
ACM Transactions on Database Systems (TODS)
Physical integrity in a large segmented database
ACM Transactions on Database Systems (TODS)
Optimal policy for batch operations: backup, checkpointing, reorganization, and updating
ACM Transactions on Database Systems (TODS)
The Recovery Manager of the System R Database Manager
ACM Computing Surveys (CSUR)
Performance analysis of checkpointing strategies
ACM Transactions on Computer Systems (TOCS)
Optimization criteria for checkpoint placement
Communications of the ACM
Optimization criteria for checkpoint placement
Communications of the ACM
The notions of consistency and predicate locks in a database system
Communications of the ACM
SIGMOD '78 Proceedings of the 1978 ACM SIGMOD international conference on management of data
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Using Lock-Based Checking Protocol for Efficient Data Broadcast in Mobile Environments
ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
Online reorganization of databases
ACM Computing Surveys (CSUR)
Information Sciences: an International Journal
| Hi-index | 0.00 |
We describe an algorithm to read entire databases with locking concurrency control allowing multiple readers or an exclusive writer. The algorithm runs concurrently with the normal transaction processing (on-the-fly), and locks the en-tities in the database one by one (incremental). We prove the algorithm produces consistent pictures of the database. We also show that the algorithm aborts a minimal number of updates in the class of on-the-fly, incremental, consistent algorithms. On-the-fly, incremental algorithms to read entire data- bases consistently can improve system availability and reli- ability. Most existing systems either require the transaction processing to stop, or produce potentially inconsistent re- sults. Our algorithm does not change the database physical design, so it can be adapted to existing systems by expand- ing their lock table. Finally, we extend the algorithm in a straightforward way to read entire distributed databases.