ACM SIGMOD Anthology TODS dblp.uni-trier.de

Applications of Byzantine Agreement in Database Systems.

Hector Garcia-Molina, Frank M. Pittelli, Susan B. Davidson: Applications of Byzantine Agreement in Database Systems. ACM Trans. Database Syst. 11(1): 27-47(1986)
@article{DBLP:journals/tods/Garcia-MolinaPD86,
  author    = {Hector Garcia-Molina and
               Frank M. Pittelli and
               Susan B. Davidson},
  title     = {Applications of Byzantine Agreement in Database Systems},
  journal   = {ACM Trans. Database Syst.},
  volume    = {11},
  number    = {1},
  year      = {1986},
  pages     = {27-47},
  ee        = {http://doi.acm.org/10.1145/5236.5243, db/journals/tods/Garcia-MolinaPD86.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX

Abstract

In this paper we study when and how a Byzantine agreement protocol can he used in general-purpose database management systems. We present an overview of the failure model used for Byzantine agreement, and of the protocol itself. We then present correctness criteria for database processing in this failure environment and discuss strategies for satisfying them. In doing this, we present new failure models for input/output nodes and study ways to distribute input transactions to processing nodes under these models. Finally, we investigate applications of Byzantine agreement protocols in the more common failure environment where processors are assumed to halt after a failure.

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

CDROM Version: Load the CDROM "Volume 3 Issue 1, TODS 1976-1990" and ... DVD Version: Load ACM SIGMOD Anthology DVD 2" and ... BibTeX

References

[1]
...
[2]
...
[3]
Philip A. Bernstein: Database Theory: Where Has It Been? Where Is It Going? (Abstract). SIGMOD Conference 1983: 2 BibTeX
[4]
C. J. Date: An Introduction to Database Systems, 3rd Edition. Addison-Wesley 1981
BibTeX
[5]
...
[6]
Danny Dolev, H. Raymond Strong: Polynomial Algorithms for Multiple Processor Agreement. STOC 1982: 401-407 BibTeX
[7]
Danny Dolev, H. Raymond Strong: Authenticated Algorithms for Byzantine Agreement. SIAM J. Comput. 12(4): 656-666(1983) BibTeX
[8]
...
[9]
Danny Dolev, Rüdiger Reischuk, H. Raymond Strong: Early Stopping in Byzantine Agreement. J. ACM 37(4): 720-741(1990) BibTeX
[10]
Joseph Y. Halpern, Barbara Simons, H. Raymond Strong, Danny Dolev: Fault-Tolerant Clock Synchronization. PODC 1984: 89-102 BibTeX
[11]
Michael J. Fischer, Nancy A. Lynch, Mike Paterson: Impossibility of Distributed Consensus with One Faulty Process. J. ACM 32(2): 374-382(1985) BibTeX
[12]
...
[13]
Hector Garcia-Molina: Elections in a Distributed Computing System. IEEE Trans. Computers 31(1): 48-59(1982) BibTeX
[14]
Jim Gray: Notes on Data Base Operating Systems. Advanced Course: Operating Systems 1978: 393-481 BibTeX
[15]
...
[16]
Leslie Lamport: Time, Clocks, and the Ordering of Events in a Distributed System. Commun. ACM 21(7): 558-565(1978) BibTeX
[17]
Leslie Lamport, Robert E. Shostak, Marshall C. Pease: The Byzantine Generals Problem. ACM Trans. Program. Lang. Syst. 4(3): 382-401(1982) BibTeX
[18]
Leslie Lamport: The Weak Byzantine Generals Problem. J. ACM 30(3): 668-676(1983) BibTeX
[19]
Leslie Lamport: Using Time Instead of Timeout for Fault-Tolerant Distributed Systems. ACM Trans. Program. Lang. Syst. 6(2): 254-280(1984) BibTeX
[20]
Leslie Lamport, P. M. Melliar-Smith: Byzantine Clock Synchronization. PODC 1984: 68-74 BibTeX
[21]
...
[22]
Jennifer Lundelius, Nancy A. Lynch: A New Fault-Tolerant Algorithm for Clock Synchronization. PODC 1984: 75-88 BibTeX
[23]
...
[24]
C. Mohan, H. Raymond Strong, Sheldon J. Finkelstein: Method for Distributed Transaction Commit and recovery Using Byzantine Agreement Within Clusters of Processors. PODC 1983: 89-103 BibTeX
[25]
Marshall C. Pease, Robert E. Shostak, Leslie Lamport: Reaching Agreement in the Presence of Faults. J. ACM 27(2): 228-234(1980) BibTeX
[26]
James B. Rothnie Jr., Philip A. Bernstein, Stephen Fox, Nathan Goodman, Michael Hammer, T. A. Landers, Christopher L. Reeve, David W. Shipman, Eugene Wong: Introduction to a System for Distributed Databases (SDD-1). ACM Trans. Database Syst. 5(1): 1-17(1980) BibTeX
[27]
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
[28]
...
[29]
...
[30]
...
[31]
Michael Stonebraker: Concurrency Control and Consistency of Multiple Copies of Data in Distributed INGRES. IEEE Trans. Software Eng. 5(3): 188-194(1979) BibTeX
[32]
...
[33]
R. Williams, Dean Daniels, Laura M. Haas, George Lapis, Bruce G. Lindsay, Pui Ng, Ron Obermarck, Patricia G. Selinger, Adrian Walker, Paul F. Wilms, Robert A. Yost: R*: An Overview of the Architecture. JCDKB 1982: 1-27 BibTeX

Referenced by

  1. Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman: Concurrency Control and Recovery in Database Systems. Addison-Wesley 1987, ISBN 0-201-10715-5
    Contents
BibTeX
ACM SIGMOD Anthology - DBLP: [Home | Search: Author, Title | Conferences | Journals]
TODS, ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Tue Jun 24 18:38:58 2008