(Enter summary)
Abstract: In this paper, we address the problem of efficiently reading a set of pages from a file
which is kept on some cylinders of a magnetic disk. It is assumed that several pages can
be read from disk in a single multi-page request without interruption by other requests.
First, a simple algorithm is presented for computing a schedule how the required pages
are read from disk. Then, the expected cost of the schedules is analyzed by using a pure
analytical model. In addition to the disk geometry, the... (Update)
Context of citations to this paper: More
...the cost of reading pages in a ran24 dom order is much higher than the cost of reading them sequentially. We assume this ratio to be 12 [22, 23]. There are also several other factors like buffering and prefetching that affect the page access cost. However, we do not consider...
.... to extract analytic parameters (e.g. 1] or make assumptions such as a uniform random spatial distribution of request addresses (e.g. [6, 7, 8]) Tape workloads are less well studied, so tape studies often assume either fully sequential I O, or some simple distribution of...
Cited by: More
Speeding Up Whole-Genome Alignment by Indexing Frequency.. - Kahveci, Ljosa, Singh (2004)
(Correct)
Declustering two-dimensional datasets over MEMS-based Storage - Hailing Yu Divyakant (2003)
(Correct)
Joining Massive High-Dimensional Datasets - Kahveci, Lang, Singh (2003)
(Correct)
Active bibliography (related documents): More All
0.8: Tuning Access Methods to Supporting Data-Intensive Queries - Seeger (1994)
(Correct)
0.5: Bounded Disorder: The Effect of the Index - Baeza-Yates
(Correct)
0.2: Towards Optimal Storage Design for Efficient Query Processing in.. - Harris (1995)
(Correct)
Similar documents based on text: More All
0.2: Progressive Merge Join: A Generic and Non-Blocking.. - Dittrich, Seeger (2002)
(Correct)
0.2: Fog Detection With Terra-Modis And Msg-Seviri - Bendix Thies And
(Correct)
0.0: Dagstuhl Workshop Performance Enhancement in Object.. - Dayal, Kemper.. (1996)
(Correct)
Related documents from co-citation: More All
8: tree: an efficient and Robust Access Method for Points and Rectangles (context) - Beckmann, Kriegel et al. - 1990
6: Fast subsequence matching in time-series databases
- Faloutsos, Ranganathan et al. - 1994
6: Reading a set of disk pages (context) - Seeger, Larson et al. - 1993
BibTeX entry: (Update)
B. Seeger. An analysis of schedules for performing multi-page requests. Information Sys., 21(5):387--407, July 1996. http://citeseer.ist.psu.edu/seeger96analysis.html More
@article{ seeger96analysis,
author = "Bernhard Seeger",
title = "An Analysis of Schedules for Performing Multi-Page Requests",
journal = "Information Systems",
volume = "21",
number = "5",
pages = "387-407",
year = "1996",
url = "citeseer.ist.psu.edu/seeger96analysis.html" }
Citations (may not include all citations):
901
Transaction Processing: Concepts and Techniques (context) - Gray, Reuter - 1993
284
An introduction to disk drive modeling
- Ruemmler, Wilkes - 1994
109
Disk scheduling revisited
- Seltzer, Chen et al. - 1990
49
Approximating block accesses in database organizations (context) - Yao - 1977
43
Analysis and performance of inverted data base structures (context) - Cardenas - 1975
33
Effects of scheduling on file memory operations (context) - Denning - 1967
29
The case for safe RAM (context) - Copeland, Keller et al. - 1989
27
The performance of three database storage structures for man.. (context) - Biliris - 1992
26
The architecture of a fault-tolerant cached RAID controller (context) - Menon, Cortney - 1993
21
Disk mirroring with alternating deferred updates (context) - Polyzois, Bhide et al. - 1993
20
The impact of global clustering on spatial database systems (context) - Brinkhoff, Kriegel - 1994
18
Operating Systems (context) - Deitel - 1990
16
Minimizing expected head movement in one-dimensional and two.. (context) - Wong - 1980
13
Reading a set of disk pages (context) - Seeger, Larson et al. - 1993
13
Globally order preserving multidimensional linear hashing (context) - Hutflesz, Six et al. - 1988
10
An efficient hybrid join algorithm: A DB2 prototype (context) - Cheng, Haderle et al. - 1991
10
Estimating block accesses in database organizations (context) - Diehr, Saharia - 1994
9
Storage hierarchies (context) - Cohen, King et al. - 1989
7
Set-oriented disk access to large complex objects (context) - Weikum - 1989
2
Computing the probability of hash table / urn overflow (context) - Ramakrishna - 1987
2
the near-optimality of the shortest-latency-time-first drum .. (context) - Stone, Fuller - 1973
1
IBM Database 2 performance: design (context) - Cheng, Loosley et al. - 1984
1
Computer Journal (context) - Waters - 1976
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.mathematik.uni-marburg.de/~seeger/publ.html): More
An Asymptotically Optimal Multiversion B-Tree - Widmayer, Becker, al.
(Correct)
The Bulk Index Join: A Generic Approach to Processing .. - van den Bercken.. (1999)
(Correct)
Tuning Access Methods to Supporting Data-Intensive Queries - Seeger (1994)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC