This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On-The-Fly Reading of Entire Databases
October 1995 (vol. 7 no. 5)
pp. 834-838

Abstract—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.

[1] D. Agrawal and A.E. Abbadi,“Locks with constrained sharing,” Proc. ACM PODS Conf., pp. 85-93, 1990.
[2] D. Agrawal,A.E. Abbadi,, and A.E. Lang,“Performance characteristics of protocols with ordered shared locks,” Proc. Int’l Conf. Data Eng., pp. 592-601, 1991.
[3] R. Bayer, H. Heller, and A. Reiser, “Parallelism and Recovery in Database Systems,” ACM Trans. Database Systems, vol. 5, no. 2, pp. 139-156, June 1980.
[4] R. Bayer,“Consistency of transactions and random batch,” ACM Trans. Database Systems, vol. 11, no. 4, pp. 397-404, Dec. 1986.
[5] P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[6] K. Brahmadathan and K.V.S. Ramarao,“On the management of long-living transactions,” J. Systems and Software, vol. 11, no. 1, pp. 45-52, Jan. 1990.
[7] K.P. Eswaran, J.N. Gray, R.A. Lorie, and I.L. Traiger, "The Notions of Consistency and Predicate Locks in a Relational Database System," Comm. ACM, vol. 8, no. 11, pp. 624-633, 1976.
[8] P. Mavuluri,“On the fly reading of entire databases,” master’s thesis, George Mason Univ., Jan. 1994.
[9] C. Mohan, H. Pirahesh, and R. Lorie, “Efficient and Flexible Methods for Transient Versioning of Records to Avoid Locking by Read-Only Transactions,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 124–133, June 1992.
[10] C. Pu,“On-the-fly, incremental, consistent reading of entire databases,” Algorithmica, vol. 1, no. 3, pp. 271-287, Oct. 1986.
[11] C. Pu,C.H. Hong,, and J.M. Wha,“Performance evaluation of global reading of entire databases,” Proc. Int’l Symp. Databases in Parallel and Distributed Systems, pp. 167-176,Austin, Texas, Dec. 1988.
[12] K. Salem, H. Garcia-Molina, and J. Shands, "Altruistic Locking," ACM Trans. Database Systems, vol. 19, no.1, pp. 117-165, Mar. 1994.

Index Terms:
Algorithms, concurrency control, database management, global reads, locking, long-lived transactions, and transaction processing.
Citation:
Paul Ammann, Sushil Jajodia, Padmaja Mavuluri, "On-The-Fly Reading of Entire Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 5, pp. 834-838, Oct. 1995, doi:10.1109/69.469836
Usage of this product signifies your acceptance of the Terms of Use.