Parallelism and recovery in database systems
ACM Transactions on Database Systems (TODS)
Optimal policy for batch operations: backup, checkpointing, reorganization, and updating
ACM Transactions on Database Systems (TODS)
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
HYDRO: a heterogeneous distributed database system
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
A Survey of Distributed Database Checkpointing
Distributed and Parallel Databases
A novel checkpointing scheme for distributed database systems
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Low-Cost Checkpointing Technique for Distributed Databases
Distributed and Parallel Databases
On-The-Fly Reading of Entire Databases
IEEE Transactions on Knowledge and Data Engineering
Performance Analysis of Dynamic Finite Versioning Schemes: Storage Cost vs. Obsolescence
IEEE Transactions on Knowledge and Data Engineering
Checkpointing for Distributed Databases: Starting from the Basics
IEEE Transactions on Parallel and Distributed Systems
Improving Parallelism in Asynchronous Reading of an Entire Database
HiPC '00 Proceedings of the 7th International Conference on High Performance Computing
Parallel on-the-fly reading of an entire database copy
Practical parallel computing
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
On Consistent Reading of Entire Databases
IEEE Transactions on Knowledge and Data Engineering
Online reorganization of databases
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Using simulation and probabilistic analysis, we study the performance of 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 entities in the database one by one (incremental). The analysis compares different strategies to resolve the conflicts between the global read algorithm and update. Since the algorithm is parallel in nature, its interference with normal transactions is minimized in parallel and distributed databases. A simulation study shows that one variant of the algorithm can read the entire database with very little overhead and interference with the updates.