DocumentCode
1021968
Title
On-the-fly reading of entire databases
Author
Ammann, Paul ; Jajodia, Sushil ; Mavuluri, Padmaja
Author_Institution
Dept. of Inf. & Software Syst. Eng., George Mason Univ., Fairfax, VA, USA
Volume
7
Issue
5
fYear
1995
fDate
10/1/1995 12:00:00 AM
Firstpage
834
Lastpage
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
Keywords
concurrency control; memory protocols; transaction processing; color test; concurrency control; database entities; execution history serialisability; global reads; global-read; long-lived transactions; on-the-fly algorithm; on-the-fly reading; shade test; transaction processing; Computer science; Concurrency control; Database systems; Distributed databases; History; Operating systems; Processor scheduling; Testing; Transaction databases; Voting;
fLanguage
English
Journal_Title
Knowledge and Data Engineering, IEEE Transactions on
Publisher
ieee
ISSN
1041-4347
Type
jour
DOI
10.1109/69.469836
Filename
469836
Link To Document