This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On Consistent Reading of Entire Databases
April 2006 (vol. 18 no. 4)
pp. 569-572
ASCII Text
x 
 
Kwok-Wa Lam, Victor C.S. Lee, "On Consistent Reading of Entire Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 4, pp. 569-572, April, 2006.
 
 
BibTex
x
 
@article{ 10.1109/TKDE.2006.64,
author = {Kwok-Wa Lam and Victor C.S. Lee},
title = {On Consistent Reading of Entire Databases},
journal ={IEEE Transactions on Knowledge and Data Engineering},
volume = {18},
number = {4},
issn = {1041-4347},
year = {2006},
pages = {569-572},
doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2006.64},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Knowledge and Data Engineering
TI - On Consistent Reading of Entire Databases
IS - 4
SN - 1041-4347
SP569
EP572
EPD - 569-572
A1 - Kwok-Wa Lam,
A1 - Victor C.S. Lee,
PY - 2006
KW - Data consistency
KW - concurrency control
KW - transaction processing
KW - serializability.
VL - 18
JA - IEEE Transactions on Knowledge and Data Engineering
ER -
 
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.

[1] P. Ammann, S. Jajodia, and P. Mavuluri, “On-the-Fly Reading of Entire Databases,” IEEE Trans. Knowledge and Data Eng., vol. 7, no. 5, Oct. 1995.
[2] P.A. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Databases Systems. Reading, Mass.: Addison-Wesley, 1987.
[3] C. Pu, “On-the-Fly, Incremental, Consistent Reading of Entire Databases,” Algorithmica, vol. 1, no. 3, pp. 271-287, 1986.
[4] 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, 1988.
[5] K.P. Eswaran, J.N. Gray, R.A. Lorie, and I.L. Traiger, “The Notions of Consistency and Predicate Locks in a Database System,” Comm. ACM, vol. 19, no. 11, pp. 624-633, 1976.
[6] H. Garcia-Molina and G. Wiederhold, “Read-Only Transactions in a Distributed Database,” ACM Trans. Database Systems, vol. 7, no. 2, pp. 209-234, 1982.

Index Terms:
Data consistency, concurrency control, transaction processing, serializability.
Citation:
Kwok-Wa Lam, Victor C.S. Lee, "On Consistent Reading of Entire Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 4, pp. 569-572, April 2006, doi:10.1109/TKDE.2006.64
Usage of this product signifies your acceptance of the Terms of Use.