Estimating block accesses in database organizations

Estimating block accesses in database organizations

The exact expression for the expected number of disk accesses required to retrieve a given number of records, called the Yao function, requires iterative computations. Several authors have developed approximations to the Yao function, all of which have substantial errors in some situations. We deriv...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on knowledge and data engineering 1994-06, Vol.6 (3), p.497-499
Hauptverfasser: Diehr, G., Saharia, A.N.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Computational efficiency
Computer science
control theory
systems
Cost function
Data engineering
Equations
Exact sciences and technology
Information retrieval
Information systems. Data bases
Memory organisation. Data processing
Query processing
Scattering
Software
Upper bound
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The exact expression for the expected number of disk accesses required to retrieve a given number of records, called the Yao function, requires iterative computations. Several authors have developed approximations to the Yao function, all of which have substantial errors in some situations. We derive and evaluate simple upper and lower bounds that never differ by more than a small fraction of a disk access.< >
ISSN:1041-4347
1558-2191
DOI:10.1109/69.334866