Reading a Set of Disk Pages

Summary: Reading a set of disk pages reduces to a shortest-path problem on a graph; nearby pages can be read together, even with gaps. A simple approximation is near-optimal; it derives the expected cost and shows buffering with large reads yields speedups. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 8158
Venue: VLDB
Year: 1993
Pagerank: 5.1528637e-05
Overall Rank: 6,218 | 56.75%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
3,740	Query Processing in Tertiary Memory Databases	1995	VLDB	6.8015038e-05
8,601	The Impact of Global Clustering on Spatial Database Systems	1994	VLDB	4.4875358e-05

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
7,386	File Allocation in Distributed Databases with Interaction between Files	1983	VLDB	4.7441292e-05
9,143	Similarity Query Processing Using Disk Arrays	1998	SIGMOD	4.3850454e-05
7,197	Incremental File Reorganization Schemes	1985	VLDB	4.8034535e-05
3,539	Scheduling Shared Scans of Large Data Files	2008	VLDB	6.9956521e-05
306	The LRU-K Page Replacement Algorithm For Database Disk Buffering	1993	SIGMOD	0.00028228982
5,196	Clustering Techniques for Minimizing External Path Length	1996	VLDB	5.6365164e-05
12,883	Analysis of Disk Arm Movement for Large Sequential Reads (Extended Abstract)	1992	PODS	4.1945683e-05
5,098	Multi-Disk B-trees	1991	SIGMOD	5.7007294e-05
4,993	Dynamic File Allocation in Disk Arrays	1991	SIGMOD	5.7818647e-05
12,823	Optimal Response Time Retrieval of Replicated Data	1994	PODS	4.1945683e-05