Discarding Obsolete Information in a Replicated Database System

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 upd...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on software engineering Ročník SE-13; číslo 1; s. 39 - 47
Hlavní autoři: Sarin, S.K., Lynch, N.A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.01.1987
Institute of Electrical and Electronics Engineers
IEEE Computer Society
Témata:
Algorithms
Applied sciences
Availability
Computer crashes
Computer science
Computer science; control theory; systems
Database systems
Distributed databases
Distributed processing
distributed snapshots
Exact sciences and technology
Government
Information
Information systems
Information systems. Data bases
Memory organisation. Data processing
mutual consistency
network partitions
Obsolescence
Partitioning algorithms
Pipelines
Protection
Protocol
Protocols
replicated data
Software
Software engineering
timestamps
Partition
Distributed database
Consistency
Transmission protocol
Network
Information processing
Updating
Replication
Timestamp
Obsolescence
ISSN:0098-5589, 1939-3520
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:0098-5589
1939-3520
DOI:10.1109/TSE.1987.232564