A fault-tolerant implementation protocol for replicated database systems on bus local area networks

Authors:
Junguk L. Kim;Heon Yeom
Affiliations:
Department of Computer Science, Texas A&M University, College Station, TX;Department of Computer Science, Texas A&M University, College Station, TX
Venue:
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
Year:
1992

Citing 11
Cited 0

Analysis of a replicated data base

Performance Evaluation
Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
Concurrency control performance modeling: alternatives and implications

ACM Transactions on Database Systems (TODS)
Analysis of query processing in distributed database systems with fully replicated files: hierarchical approach

Performance Evaluation
A Majority consensus approach to concurrency control for multiple copy databases

ACM Transactions on Database Systems (TODS)
Ethernet: distributed packet switching for local computer networks

Communications of the ACM
The notions of consistency and predicate locks in a database system

Communications of the ACM
Performance evaluation of a two-phase commit based protocol for DDBs

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Analysis of Replication in Distributed Database Systems

IEEE Transactions on Knowledge and Data Engineering
Weighted voting for replicated data

SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
A principle for resilient sharing of distributed resources

ICSE '76 Proceedings of the 2nd international conference on Software engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new protocol for implementing a replicated database system on a bus local network. Using the broadcast capability of the bus local network, our protocol handles the database request efficiently with a small number of messages. Unlike existing schemes, our implementation protocol provides high resiliency as well as the fast response time. The system continues to service the requests as long as there is at least one site available, and, even when there is no site failure, the overall performance is better than the primary copy approach which is known to be most efficient. Simulation results are provided to compare the performance.