DBScholar

Back to papers

An Efficient, Fault-Tolerant Protocol For Replicated Data Management

Summary: Derives a replication protocol ensuring serializability w.r.t. a non-replicated DB while tolerating arbitrary omission/performance failures, network partitions, and unlimited recoveries. Reads nearest replica efficiently, optimizing read‑heavy workloads and outperforming prior schemes when reads dominate and failures are rare. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
737
Venue
PODS
Year
1985
Pagerank
0.00011393583
Overall Rank
1,268 | 91.31%
DOI
10.1145/325405.325443

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{abbadi_pods85,
        address = {New York, NY, USA},
        series = {{PODS} '85},
        title = {{AN EFFICIENT, FAULT-TOLERANT PROTOCOL FOR REPLICATED DATA MANAGEMENT}},
        url = {https://dl.acm.org/doi/10.1145/325405.325443},
        doi = {10.1145/325405.325443},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Abbadi, Amr El and Skeen, Dale and Cristian, Flaviu},
        year = {1985}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 1 of 1 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
4,823 Increasing Availability in Partitioned Database Systems (extended abstract) 1984 PODS 6.4917361e-05
Previous Page 1 / 1 Next

Semantically Similar Papers