DBScholar

Back to papers

High Throughput Escrow Algorithms for Replicated Databases (Extended Abstract)

Summary: Generalized Site Escrow (GSE) enables high-throughput replicated-database transactions with loose inter-site synchronization, quorum locking, and background gossip. Compared with TE, GSE's performance regions are mapped; hybrids switch between GSE and TE, and a locking-free variant is proposed. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hd4ca071c09d56cbe
Venue
VLDB
Year
1992
Pagerank
4.9793485e-05
Overall Rank
13,381 | 10.04%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{bernstein_vldb92,
        title = {{High Throughput Escrow Algorithms for Replicated Databases (Extended Abstract)}},
        author = {Bernstein, Arthur J. and Krishnakumar, Narayanan},
        journal = {PVLDB},
        series = {{VLDB} '92},
        pages = {175},
        year = {1992}
}

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 3 of 3 cited papers.

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

Rank Cited Paper Year Venue Pagerank
3,776 Data-value Partitioning and Virtual Messages 1990 PODS 7.0271327e-05
4,096 Bounded Ignorance in Replicated Systems 1991 PODS 6.8094639e-05
6,050 Semantics Based Transaction Management Techniques for Replicated Data 1988 SIGMOD 5.9034376e-05
Previous Page 1 / 1 Next

Semantically Similar Papers