Database Paper Browser

Back to papers

Optimal Response Time Retrieval of Replicated Data

Summary: Reduce optimal access planning for retrieving sets of replicated pages to a network-flow formulation, yielding polynomial-time optimal disk-access schedules and extensions for heterogeneous/preloaded/distributed disks. Prove a universal worst-case response-time lower bound over all replication schemes, present a scheme that attains it, and show simulations where that scheme also substantially reduces average response time. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1014
Venue
PODS
Year
1994
Pagerank
4.1945683e-05
Overall Rank
12,823 | 10.80%
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 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
75 Disk Shadowing 1988 VLDB 0.00057303824
6,030 Disk Mirroring with Alternating Deferred Updates 1993 VLDB 5.2415551e-05
7,974 Declustering Objects for Visualization 1993 VLDB 4.613363e-05
Previous Page 1 / 1 Next

Semantically Similar Papers