DBScholar

Back to papers

Reducing Storage for Quorum Consensus Algorithms

Summary: Introduces fragmentation and log-based propagation to reduce replicated-object storage while preserving quorum-level read/write availability and enabling recovery from catastrophic media loss. Generalizes quorum consensus to fragmented data, trading storage savings for communication and resilience costs. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
8062
Venue
VLDB
Year
1988
Pagerank
5.093636e-05
Overall Rank
13,169 | 9.65%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{agrawal_vldb88,
        title = {{Reducing Storage for Quorum Consensus Algorithms}},
        author = {Agrawal, Divyakant and Abbadi, Amr El},
        journal = {PVLDB},
        series = {{VLDB} '88},
        year = {1988}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
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
1,189 Sacrificing Serializability to Attain High Availability of Data in an Unreliable Network 1982 PODS 0.00011749508
Previous Page 1 / 1 Next

Semantically Similar Papers