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
Read-only transactions in a distributed database
ACM Transactions on Database Systems (TODS)
The notions of consistency and predicate locks in a database system
Communications of the ACM
On-The-Fly Reading of Entire Databases
IEEE Transactions on Knowledge and Data Engineering
Online reorganization of databases
ACM Computing Surveys (CSUR)
On-line consistent backup in transactional file systems
Proceedings of the first ACM asia-pacific workshop on Workshop on systems
| Hi-index | 0.00 |
Many applications need to read an entire database in a consistent way. This global-reading of an entire database formulated as a global-read transaction (GRT) is not a trivial issue since it will cause a high degree of interference to other concurrent transactions. Conventional concurrency control protocols are obviously inadequate in handling the long-lived GRT. Previous studies [1], [3], [4] proposed additional tests, namely, the Color Test and the Shade Test, to handle conflicts between the GRT and update transactions. However, we discovered that both algorithms can bring about nonserializable schedules of transactions. We propose an enhanced algorithm directly built on the two algorithms to guarantee the serializability of transactions.