Optimistic algorithms for partial database replication
- Schiper, Nicolas Facoltà di scienze informatiche, Università della Svizzera italiana, Svizzera
- Schmidt, Rodrigo Facoltà di scienze informatiche, Università della Svizzera italiana, Svizzera
- Pedone, Fernando Facoltà di scienze informatiche, Università della Svizzera italiana, Svizzera
-
2006
18 p.
English
In this paper, we study the problem of partial database replication. Numerous previous works have investigated database replication, however, most of them focus on full replication. We are here interested in genuine partial replication protocols, which require replicas to permanently store only information about data items they replicate. We define two properties to characterize partial replication. The first one, Quasi-Genuine Partial Replication, captures the above idea; the second one, Non-Trivial Certification, rules out solutions that would abort transactions unnecessarily in an attempt to ensure the first property. We also present two algorithms that extend the Database State Machine [8] to partial replication and guarantee the two aforementioned properties. Our algorithms compare favorably to existing solutions both in terms of number of messages and communication steps.
- Language
-
- English
- Classification
- Computer science and technology
- License
- License undefined
- Identifiers
-
- RERO DOC 10712
- ARK ark:/12658/srd1317885
- Persistent URL
- https://n2t.net/ark:/12658/srd1317885
Statistics
Document views: 19
File downloads:
- ITR0602.pdf: 66