The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data.

Divyakant Agrawal, Amr El Abbadi: The Tree Quorum Protocol: An Efficient Approach for Managing Replicated Data. VLDB 1990: 243-254

@inproceedings{DBLP:conf/vldb/AgrawalA90,
  author    = {Divyakant Agrawal and
               Amr El Abbadi},
  editor    = {Dennis McLeod and
               Ron Sacks-Davis and
               Hans-J{\"o}rg Schek},
  title     = {The Tree Quorum Protocol: An Efficient Approach for Managing
               Replicated Data},
  booktitle = {16th International Conference on Very Large Data Bases, August
               13-16, 1990, Brisbane, Queensland, Australia, Proceedings},
  publisher = {Morgan Kaufmann},
  year      = {1990},
  isbn      = {1-55860-149-X},
  pages     = {243-254},
  ee        = {db/conf/vldb/AgrawalA90.html},
  crossref  = {DBLP:conf/vldb/90},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

In this paper, we present an efficient algorithm for managing replicated data. We impose a logical tree structure on the set of copies of an object. In a failure- free environment the protocol executes read operations by reading one copy of an object while guaranteeing fault-tolerance of write operations. It also exhibits the property of graceful degradation, i.e., communication costs are minimal in a failure-free environment but may increase as failures occur. This approach in designing distributed systems is desirable since it provides fault- tolerance without imposing unnecessary costs on the failure-free mode of operations.

Copyright © 1990 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

Download PDF file (www.vldb.org, Darmstadt, Germany)
Download PDF file (www.acm.org, New York, USA)

ACM SIGMOD Anthology

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

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the CD and click on the path of your mount point:
/Anthology/vldb8997 or /cdrom

DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...

Windows: Click the letter of your CD drive
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Mac: Click here
UNIX/LINUX: mount the DVD and click on the path of your mount point:
/Anthology/aDVD1 or /dvd

Printed Edition

Dennis McLeod, Ron Sacks-Davis, Hans-Jörg Schek (Eds.): 16th International Conference on Very Large Data Bases, August 13-16, 1990, Brisbane, Queensland, Australia, Proceedings. Morgan Kaufmann 1990, ISBN 1-55860-149-X

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)
[AE89]: Divyakant Agrawal, Amr El Abbadi: Efficient Solution to the Distributed Mutual Exclusion Problem. PODC 1989: 193-200
[AE90]: Divyakant Agrawal, Amr El Abbadi: Exploiting Logical Structures in Replicated Databases. Inf. Process. Lett. 33(5): 255-260(1990)
[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)
[DB85]: Danco Davcev, Walter A. Burkhard: Consistency and Recovery Control for Replicated Files. SOSP 1985: 87-96
[DGMS85]: Susan B. Davidson, Hector Garcia-Molina, Dale Skeen: Consistency in Partitioned Networks. ACM Comput. Surv. 17(3): 341-370(1985)
[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)
[ES83]: Derek L. Eager, Kenneth C. Sevcik: Achieving Robustness in Distributed Database Systems. ACM Trans. Database Syst. 8(3): 354-381(1983)
[ESC85]: Amr El Abbadi, Dale Skeen, Flaviu Cristian: An Efficient, Fault-Tolerant Protocol for Replicated Data Management. PODS 1985: 215-229
[ET89]: Amr El Abbadi, Sam Toueg: Maintaining Availability in Partitioned Replicated Databases. ACM Trans. Database Syst. 14(2): 264-290(1989)
[Gif79]: David K. Gifford: Weighted Voting for Replicated Data. SOSP 1979: 150-162
[Her86]: Maurice Herlihy: A Quorum-Consensus Replication Method for Abstract Data Types. ACM Trans. Comput. Syst. 4(1): 32-53(1986)
[Her87]: Maurice Herlihy: Dynamic Quorum Adjustment for Partitioned Data. ACM Trans. Database Syst. 12(2): 170-194(1987)
[JM87]: Sushil Jajodia, David Mutchler: Dynamic Voting. SIGMOD Conference 1987: 227-238
[Kum90]: Akhil Kumar: Performance Analysis of Hierarchical Quorum Consensus Algorithm for Replicated Objects. ICDCS 1990: 378-385
[Mae85]: Mamoru Maekawa: A Square Root N Algorithm for Mutual Exclusion in Decentralized Systems. ACM Trans. Comput. Syst. 3(2): 145-159(1985)
[MS85]: Stephen R. Mahaney, Fred B. Schneider: Inexact Agreement: Accuracy, Precision, and Graceful Degradation. PODC 1985: 237-249
[PL88]: Jehan-François Pâris, Darrell D. E. Long: Efficient Dynamic Voting Algorithms. ICDE 1988: 268-275
[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)