Estimating Page Fetches for Index Scans with Finite LRU Buffers.
Arun N. Swami, K. Bernhard Schiefer:
Estimating Page Fetches for Index Scans with Finite LRU Buffers.
VLDB J. 4(4): 675-701(1995)@article{DBLP:journals/vldb/SwamiS95,
author = {Arun N. Swami and
K. Bernhard Schiefer},
title = {Estimating Page Fetches for Index Scans with Finite LRU Buffers},
journal = {VLDB J.},
volume = {4},
number = {4},
year = {1995},
pages = {675-701},
ee = {db/journals/vldb/SwamiS95.html},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
We describe an algorithm for estimating the number of page fetches for a
partial or complete scan of a B-tree index.
The algorithm obtains estimates for the number of page fetches for an index
scan when given the number of tuples selected and the number of LRU buffers
currently available.
The algorithm has an initial phase that is performed exactly once before any
estimates are calculated.
This initial phase,
involving LRU buffer modeling,
requires a scan of all the index entries and calculates the number of page fetches for
different buffer sizes.
An approximate empirical model is obtained from this data.
Subsequently, an inexpensive estimation procedure is called by the
query optimizer whenever it needs an estimate of the page fetches for the
index scan.
This procedure utilizes the empirical model obtained in the initial phase.
Copyright © 1995 by the VLDB Endowment.
Permission to copy without fee all or part of this material is granted provided that the copies are not made or
distributed for direct commercial advantage, the VLDB
copyright notice and the title of the publication and
its date appear, and notice is given that copying
is by the permission of the Very Large Data Base
Endowment. To copy otherwise, or to republish, requires
a fee and/or special permission from the Endowment.
Key Words
Estimation,
query optimization,
index scan,
LRU.
Preliminary Version: SIGMOD 1994: 173-184
Online Paper
CDROM Version: Load the CDROM "Volume 4 Issue 1, Books, VLDB-j, TODS, ..." and ...
DVD Version: Load ACM SIGMOD Anthology DVD 2" and ...
BibTeX
References
- [Cardenas 1975]
- Alfonso F. Cardenas:
Analysis and Performance of Inverted Data Base Structures.
Commun. ACM 18(5): 253-263(1975) BibTeX
- [Christodoulakis 1984]
- Stavros Christodoulakis:
Estimating Block Selectivities.
Inf. Syst. 9(1): 69-79,(1984) BibTeX
- [Knuth 1973]
- Donald E. Knuth:
The Art of Computer Programming, Volume III: Sorting and Searching.
Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX
- [Mackert & Lohman 1989]
- Lothar F. Mackert, Guy M. Lohman:
Index Scans Using a Finite LRU Buffer: A Validated I/O Model.
ACM Trans. Database Syst. 14(3): 401-424(1989) BibTeX
- [Mannino et al. 1988]
- Michael V. Mannino, Paicheng Chu, Thomas Sager:
Statistical Profile Estimation in Database Systems.
ACM Comput. Surv. 20(3): 191-221(1988) BibTeX
- [Mattson et al. 1970]
- ...
- [Natarajan 1991]
- ...
- [Steindel & Madison 1987]
- ...
- [Vander Zanden et al. 1986]
- Brad T. Vander Zanden, Howard M. Taylor, Dina Bitton:
Estimating Block Accessses when Attributes are Correlated.
VLDB 1986: 119-127 BibTeX
- [Waters 1976]
- S. J. Waters:
Hit Ratios.
Comput. J. 19(1): 21-24(1976) BibTeX
- [Wolf et al. 1990]
- Joel L. Wolf, Daniel M. Dias, Philip S. Yu:
An Effective Algorithm for Parallelizing Sort Merge in the Presence of Data Skew.
DPDS 1990: 103-115 BibTeX
- [Yao 1977]
- S. Bing Yao:
Approximating the Number of Accesses in Database Organizations.
Commun. ACM 20(4): 260-261(1977) BibTeX
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
VLDB Journal: 1992-1995 Copyright © by VLDB Endowment / 1996-... Copyright © by Springer Verlag,
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sun May 17 00:31:25 2009