Database Paper Browser

Back to papers

Reducing Storage for Quorum Consensus Algorithms

Summary: Fragmentation reduces storage overhead for replicated objects; a data-management protocol generalizes quorum consensus to fragmented data. Adding a log-based propagation mechanism recovers equivalent resiliency for reads and writes while preserving storage savings. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
7871
Venue
VLDB
Year
1988
Pagerank
4.1945683e-05
Overall Rank
12,972 | 9.76%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

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
787 Sacrificing Serializability to Attain High Availability of Data in an Unreliable Network 1982 PODS 0.00016652167
Previous Page 1 / 1 Next

Semantically Similar Papers