Principles of transaction-oriented database recovery
ACM Computing Surveys (CSUR)
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
Management of a remote backup copy for disaster recovery
ACM Transactions on Database Systems (TODS)
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
Recovery mechanisms in database systems
Recovery mechanisms in database systems
Locks with constrained sharing (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Parallelism and recovery in database systems
ACM Transactions on Database Systems (TODS)
High speed on-line backup when using logical log operations
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
On-The-Fly Reading of Entire Databases
IEEE Transactions on Knowledge and Data Engineering
Performance Characteristics of Protocols With Ordered Shared Locks
Proceedings of the Seventh International Conference on Data Engineering
Exploiting A History Database for Backup
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
| Hi-index | 0.00 |
To recover from media failures, a database is 'restored' from an earlier backup copy. A recovery log of transactions is used to roll forward from the backup version to the desired time (the current time). High availability requires that the backup copying be fast, and be in parallel with on-going update activity. It also necessitates, frequently obtaining a consistent copy of an entire database. Such concurrent generation of a database copy, interferes with system activity. It introduces blocking and delays for many update transactions. We propose an algorithm that reads current database entities without interference with update activity. The algorithm is simple to implement as compared with previous proposals. It assigns a color to each entity read by the global-read. Normal transactions commit by declaring a color for the committed updates. Subsequently, these markings are used for generation of a consistent copy of the entire database.