Discarding Obsolete Information in a Replicated Database System
- 1 January 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-13 (1) , 39-47
- https://doi.org/10.1109/tse.1987.232564
Abstract
A replicated database architecture is described in which updates processed at a site must be saved to allow reconcilliation of newly arriving updates in a way that preserves mutual consistency. The storage space occupied by the saved updates increases indefinitely, and periodic discarding of old updates is needed to avoid running out of storage. A protocol is described which allows sites in the system to agree that updates older than a given timestamp are no longer needed and can be discarded. This protocol uses a "distributed snapshot" algorithm of Chandy and Lamport and represents a practical application of that algorithm. A protocol for permanent removal of sites is also described, which will allow the discarding of updates to continue when one or more sites crash and are expected not to recover.Keywords
This publication has 7 references indexed in Scilit:
- System architecture for partition-tolerant distributed databasesIEEE Transactions on Computers, 1985
- Virtual timeACM Transactions on Programming Languages and Systems, 1985
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- Efficient and reliable broadcast is achievable in an eventually connected network(Extended Abstract)Published by Association for Computing Machinery (ACM) ,1984
- GrapevineCommunications of the ACM, 1982
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978
- Maintenance of duplicate databasesPublished by RFC Editor ,1975