Reducing Storage for Quorum Consensus Algorithms.

Divyakant Agrawal, Amr El Abbadi: Reducing Storage for Quorum Consensus Algorithms. VLDB 1988: 419-430

@inproceedings{DBLP:conf/vldb/AgrawalA88,
  author    = {Divyakant Agrawal and
               Amr El Abbadi},
  editor    = {Fran\c{c}ois Bancilhon and
               David J. DeWitt},
  title     = {Reducing Storage for Quorum Consensus Algorithms},
  booktitle = {Fourteenth International Conference on Very Large Data Bases,
               August 29 - September 1, 1988, Los Angeles, California, USA,
               Proceedings},
  publisher = {Morgan Kaufmann},
  year      = {1988},
  isbn      = {0-934613-75-3},
  pages     = {419-430},
  ee        = {db/conf/vldb/AgrawalA88.html},
  crossref  = {DBLP:conf/vldb/88},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

In this paper, we first develop a fragmentation method that reduces the storage overhead of replicated objects. We then present a data management protocol for these fragmented objects, and show that this protocol is a generalisation of quorum consensus algorithms for replicated data in which objects are not fragmented. Although this protocol reduces storage requirements, it does not achieve the same level of resiliency for both read and write operations. By integrating a log-based propagation mechanism with our protocol, we are able to achieve the same level of resiliency for both read and write operations as other quorum consensus protocols, while reducing the storage cost.

Copyright © 1988 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 4, VLDB '75-'88" 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/vldb7588 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

François Bancilhon, David J. DeWitt (Eds.): Fourteenth International Conference on Very Large Data Bases, August 29 - September 1, 1988, Los Angeles, California, USA, Proceedings. Morgan Kaufmann 1988, ISBN 0-934613-75-3

References

[1]: Mustaque Ahamad, Mostafa H. Ammar: Performance Characterization of Quorum-Consensus Algorithms for Replicated Data. IEEE Trans. Software Eng. 15(4): 492-501(1989)
[2]: Philip A. Bernstein, Nathan Goodman: Concurrency Control in Distributed Database Systems. ACM Comput. Surv. 13(2): 185-221(1981)
[3]: Philip A. Bernstein, Nathan Goodman: The Failure and Recovery Problem for Replicated Databases. PODC 1983: 114-122
[4]: Susan B. Davidson, Hector Garcia-Molina, Dale Skeen: Consistency in Partitioned Networks. ACM Comput. Surv. 17(3): 341-370(1985)
[5]: 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)
[6]: Michael J. Fischer, A. Michael: Sacrificing Serializability to Attain High Availability of Data. PODS 1982: 70-75
[7]: David K. Gifford: Weighted Voting for Replicated Data. SOSP 1979: 150-162
[8]: ...
[9]: Thomas A. Joseph, Kenneth P. Birman: Low Cost Management of Replicated Data in Fault-Tolerant Distributed Systems. ACM Trans. Comput. Syst. 4(1): 54-70(1986)
[10]: Leslie Lamport: Time, Clocks, and the Ordering of Events in a Distributed System. Commun. ACM 21(7): 558-565(1978)
[11]: ...
[12]: Jehan-François Pâris: Voting with Witnesses: A Constistency Scheme for Replicated Files. ICDCS 1986: 606-612
[13]: 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)
[14]: Fred B. Schneider: Synchronization in Distributed Programs. ACM Trans. Program. Lang. Syst. 4(2): 125-148(1982)
[15]: Gene T. J. Wuu, Arthur J. Bernstein: Efficient Solutions to the Replicated Log and Dictionart Problems. PODC 1984: 233-242