Issue No.05 - October (1995 vol.7)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/69.469836
<p><it>Abstract</it>—A common database need is to obtain a global-read, which is a consistent read of an entire database. To avoid terminating normal system activity, and thus improve availability, we propose an on-the-fly algorithm that reads database entities incrementally and allows normal transactions to proceed concurrently. The algorithm assigns each entity a color based on whether the entity has been globally read, and a shade based on how normal transactions have accessed the entity. Serializability of execution histories is ensured by requiring normal transactions to pass both a color test and a shade test before being allowed to commit. Our algorithm improves on a color-only-based scheme from the literature; the color-only scheme does not guarantee serializability.</p>
Algorithms, concurrency control, database management, global reads, locking, long-lived transactions, and transaction processing.
Paul Ammann, Sushil Jajodia, Padmaja Mavuluri, "On-The-Fly Reading of Entire Databases", IEEE Transactions on Knowledge & Data Engineering, vol.7, no. 5, pp. 834-838, October 1995, doi:10.1109/69.469836