loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
28th Hawaii International Conference on System Sciences (HICSS'95)
Hawaii, USA
January 04-January 07
ISBN: 0-8186-6935-7
R. Jalili, Dept. of Comput. Sci., Sydney Univ., NSW, Australia
F.A. Henskens, Dept. of Comput. Sci., Sydney Univ., NSW, Australia
In a persistent object store, the acts of modifying data and reading modified data result in the creation of dependencies between the modifying process and the data. Dependencies may be represented using sets, and over time these may grow to encompass many objects and processes. Checkpoint and roll-back operations must propagate to all elements in such a set. This paper presents a new notation for representing dependencies, and shows that differentiating between the dependencies created by modifying data and reading modified data reduces the extent of propagation of checkpoint and roll-back operations.
Index Terms:
directed graphs; object-oriented databases; database theory; fault tolerant computing; directed graphs; entity dependency; distributed persistent stores; persistent object store; checkpoint; roll-back; stability; dependency; persistent systems; fault-tolerant systems
Citation:
R. Jalili, F.A. Henskens, "Using directed graphs to describe entity dependency in stable distributed persistent stores," hicss, pp.665, 28th Hawaii International Conference on System Sciences (HICSS'95), 1995
Usage of this product signifies your acceptance of the Terms of Use.