ACM SIGMOD Anthology VLDB dblp.uni-trier.de

Resilient Logical Structures for Efficient Management of Replicated Data.

Divyakant Agrawal, Amr El Abbadi: Resilient Logical Structures for Efficient Management of Replicated Data. VLDB 1992: 151-162
@inproceedings{DBLP:conf/vldb/AgrawalA92,
  author    = {Divyakant Agrawal and
               Amr El Abbadi},
  editor    = {Li-Yan Yuan},
  title     = {Resilient Logical Structures for Efficient Management of Replicated
               Data},
  booktitle = {18th International Conference on Very Large Data Bases, August
               23-27, 1992, Vancouver, Canada, Proceedings},
  publisher = {Morgan Kaufmann},
  year      = {1992},
  isbn      = {1-55860-151-1},
  pages     = {151-162},
  ee        = {db/conf/vldb/AgrawalA92.html},
  crossref  = {DBLP:conf/vldb/92},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Replicated data management protocols have been proposed that exploit a logically structured set of copies. These protocols have the advantage that they provide limited fault-tolerance atlow communication cost. The proposed protocols can be viewed as analogues of the read-one write-all protocol in the context of logical structures. In this paper, these protocols are generalized in two ways for a grid and a tree structure. First, the quorum based approach is applied to develop protocols that use structured read and write quorums, thus attaining a high degree of data availabilityfor both read and write operations. Next, the reconfiuration or views approach is developed for both grid and tree structures resulting in protocols that attain high degrees of availability at significantly low communication cost for read operations. In this sense, the proposed protocols have the advantages of the read- one write-all protocol for low cost read operations as well as the majority quorum protocol for high data availability.

Copyright © 1992 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.


Online Paper

ACM SIGMOD Anthology

CDROM Version: Load the CDROM "Volume 1 Issue 5, VLDB '89-'97" and ... DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Printed Edition

Li-Yan Yuan (Ed.): 18th International Conference on Very Large Data Bases, August 23-27, 1992, Vancouver, Canada, Proceedings. Morgan Kaufmann 1992, ISBN 1-55860-151-1
Contents CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

References

[AA89]
Mustaque Ahamad, Mostafa H. Ammar: Performance Characterization of Quorum-Consensus Algorithms for Replicated Data. IEEE Trans. Software Eng. 15(4): 492-501(1989) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[AE90]
Divyakant Agrawal, Amr El Abbadi: The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data. VLDB 1990: 243-254 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[AE91]
Divyakant Agrawal, Amr El Abbadi: An Efficient and Fault-Tolerant Solution for Distributed Mutual Exclusion. ACM Trans. Comput. Syst. 9(1): 1-20(1991) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[AE92]
Divyakant Agrawal, Amr El Abbadi: The Generalized Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data. ACM Trans. Database Syst. 17(4): 689-717(1992) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[BG87]
Philip A. Bernstein, Nathan Goodman: A Proof Technique for Concurrency Control and Recovery Algorithms for Replicated Databases. Distributed Computing 2(1): 32-44(1987) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[CAA90]
Shun Yan Cheung, Mostafa H. Ammar, Mustaque Ahamad: The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data. ICDE 1990: 438-445 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[DB85]
Danco Davcev, Walter A. Burkhard: Consistency and Recovery Control for Replicated Files. SOSP 1985: 87-96 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[DGS85]
Susan B. Davidson, Hector Garcia-Molina, Dale Skeen: Consistency in Partitioned Networks. ACM Comput. Surv. 17(3): 341-370(1985) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[EGLT76]
Kapali P. Eswaran, Jim Gray, Raymond A. Lorie, Irving L. Traiger: The Notions of Consistency and Predicate Locks in a Database System. Commun. ACM 19(11): 624-633(1976) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[ES83]
Derek L. Eager, Kenneth C. Sevcik: Achieving Robustness in Distributed Database Systems. ACM Trans. Database Syst. 8(3): 354-381(1983) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[ESC85]
Amr El Abbadi, Dale Skeen, Flaviu Cristian: An Efficient, Fault-Tolerant Protocol for Replicated Data Management. PODS 1985: 215-229 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[ET89]
Amr El Abbadi, Sam Toueg: Maintaining Availability in Partitioned Replicated Databases. ACM Trans. Database Syst. 14(2): 264-290(1989) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[GB85]
Hector Garcia-Molina, Daniel Barbará: How to Assign Votes in a Distributed System. J. ACM 32(4): 841-860(1985) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Gif79]
David K. Gifford: Weighted Voting for Replicated Data. SOSP 1979: 150-162 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Gra78]
Jim Gray: Notes on Data Base Operating Systems. Advanced Course: Operating Systems 1978: 393-481 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Her86]
Maurice Herlihy: A Quorum-Consensus Replication Method for Abstract Data Types. ACM Trans. Comput. Syst. 4(1): 32-53(1986) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[JM90]
Sushil Jajodia, David Mutchler: Dynamic Voting Algorithms for Maintaining the Consistency of a Replicated Database. ACM Trans. Database Syst. 15(2): 230-280(1990) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Mae85]
Mamoru Maekawa: A Square Root N Algorithm for Mutual Exclusion in Decentralized Systems. ACM Trans. Comput. Syst. 3(2): 145-159(1985) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[PL88]
Jehan-François Pâris, Darrell D. E. Long: Efficient Dynamic Voting Algorithms. ICDE 1988: 268-275 CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[SS82]
Richard D. Schlichting, Fred B. Schneider: Fail-Stop Processors: An Approach to Designing Fault-Tolerant Computing Systems. ACM Trans. Comput. Syst. 1(3): 222-238(1983) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Sto79]
Michael Stonebraker: Concurrency Control and Consistency of Multiple Copies of Data in Distributed INGRES. IEEE Trans. Software Eng. 5(3): 188-194(1979) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML
[Tho79]
Robert H. Thomas: A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases. ACM Trans. Database Syst. 4(2): 180-209(1979) CiteSeerX Google scholar pubzone.org BibTeX bibliographical record in XML

Copyright © Mon Nov 2 21:18:38 2009 by Michael Ley (ley@uni-trier.de)