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

@article{DBLP:journals/tods/AgrawalA92,
  author    = {Divyakant Agrawal and
               Amr El Abbadi},
  title     = {The Generalized Tree Quorum Protocol: An Efficient Approach for
               Managing Replicated Data},
  journal   = {ACM Trans. Database Syst.},
  volume    = {17},
  number    = {4},
  year      = {1992},
  pages     = {689-717},
  ee        = {http://doi.acm.org/10.1145/146931.146935, db/journals/tods/AgrawalA92.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Copyright © 1992 by the ACM, Inc., used by permission. Permission to make digital or hard copies is granted provided that copies are not made or distributed for profit or direct commercial advantage, and that copies show this notice on the first page or initial screen of a display along with the full citation.

Joint ACM SIGMOD / IEEE Computer Society Anthology

• 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/An3-2 or /cdrom

• 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/aDVD2 or /dvd

Online Edition: ACM Digital Library

References

[1]

Divyakant Agrawal, Amr El Abbadi: Efficient Solution to the Distributed Mutual Exclusion Problem. PODC 1989: 193-200 BibTeX

[2]

Divyakant Agrawal, Amr El Abbadi: Exploiting Logical Structures in Replicated Databases. Inf. Process. Lett. 33(5): 255-260(1990) BibTeX

[3]

Divyakant Agrawal, Amr El Abbadi: Locks with Constrained Sharing. PODS 1990: 85-93 BibTeX

[4]

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

[5]

Mustaque Ahamad, Mostafa H. Ammar: Performance Characterization of Quorum-Consensus Algorithms for Replicated Data. IEEE Trans. Software Eng. 15(4): 492-501(1989) BibTeX

[6]

Philip A. Bernstein, Nathan Goodman: A Proof Technique for Concurrency Control and Recovery Algorithms for Replicated Databases. Distributed Computing 2(1): 32-44(1987) BibTeX

[7]

Danco Davcev, Walter A. Burkhard: Consistency and Recovery Control for Replicated Files. SOSP 1985: 87-96 BibTeX

[8]

Susan B. Davidson, Hector Garcia-Molina, Dale Skeen: Consistency in Partitioned Networks. ACM Comput. Surv. 17(3): 341-370(1985) BibTeX

[9]

Derek L. Eager, Kenneth C. Sevcik: Achieving Robustness in Distributed Database Systems. ACM Trans. Database Syst. 8(3): 354-381(1983) BibTeX

[10]

Amr El Abbadi, Dale Skeen, Flaviu Cristian: An Efficient, Fault-Tolerant Protocol for Replicated Data Management. PODS 1985: 215-229 BibTeX

[11]

Amr El Abbadi, Sam Toueg: Maintaining Availability in Partitioned Replicated Databases. ACM Trans. Database Syst. 14(2): 264-290(1989) BibTeX

[12]

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) BibTeX

[13]

Hector Garcia-Molina, Daniel Barbará: How to Assign Votes in a Distributed System. J. ACM 32(4): 841-860(1985) BibTeX

[14]

David K. Gifford: Weighted Voting for Replicated Data. SOSP 1979: 150-162 BibTeX

[15]

Jim Gray: Notes on Data Base Operating Systems. Advanced Course: Operating Systems 1978: 393-481 BibTeX

[16]

Maurice Herlihy: A Quorum-Consensus Replication Method for Abstract Data Types. ACM Trans. Comput. Syst. 4(1): 32-53(1986) BibTeX

[17]

Maurice Herlihy: Dynamic Quorum Adjustment for Partitioned Data. ACM Trans. Database Syst. 12(2): 170-194(1987) BibTeX

[18]

Sushil Jajodia, David Mutchler: Dynamic Voting Algorithms for Maintaining the Consistency of a Replicated Database. ACM Trans. Database Syst. 15(2): 230-280(1990) BibTeX

[19]

Akhil Kumar: Performance Analysis of Hierarchical Quorum Consensus Algorithm for Replicated Objects. ICDCS 1990: 378-385 BibTeX

[20]

H. T. Kung, John T. Robinson: On Optimistic Methods for Concurrency Control. ACM Trans. Database Syst. 6(2): 213-226(1981) BibTeX

[21]

Mamoru Maekawa: A Square Root N Algorithm for Mutual Exclusion in Decentralized Systems. ACM Trans. Comput. Syst. 3(2): 145-159(1985) BibTeX

[22]

Stephen R. Mahaney, Fred B. Schneider: Inexact Agreement: Accuracy, Precision, and Graceful Degradation. PODC 1985: 237-249 BibTeX

[23]

Jehan-François Pâris, Darrell D. E. Long: Efficient Dynamic Voting Algorithms. ICDE 1988: 268-275 BibTeX

[24]

...

[25]

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) BibTeX

[26]

Abraham Silberschatz, Zvi M. Kedem: Consistency in Hierarchical Database Systems. J. ACM 27(1): 72-80(1980) BibTeX

[27]

Robert H. Thomas: A Majority Consensus Approach to Concurrency Control for Multiple Copy Databases. ACM Trans. Database Syst. 4(2): 180-209(1979) BibTeX

Referenced by

1. Divyakant Agrawal, Amr El Abbadi: Using Reconfiguration for Efficient Management of Replicated Data. IEEE Trans. Knowl. Data Eng. 8(5): 786-801(1996)
2. Parvathi Chundi, Daniel J. Rosenkrantz, S. S. Ravi: Deferred Updates and Data Placement in Distributed Databases. ICDE 1996: 469-476
3. Divyakant Agrawal, Amr El Abbadi: Resilient Logical Structures for Efficient Management of Replicated Data. VLDB 1992: 151-162