Estimating block accesses in database organizations

Author

Diehr, George ; Saharia, Aditya N.

Author_Institution

Coll. of Bus. Adm., California State Univ., San Marcos, CA, USA

Volume

Issue

fYear

1994

fDate

6/1/1994 12:00:00 AM

Firstpage

497

Lastpage

499

Abstract

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

Keywords

database management systems; database theory; errors; file organisation; performance evaluation; Yao function; access path selection; approximation; block access estimation; database organization; disk accesses; errors; iterative computations; lower bound; performance estimation; physical database design; record retrieval; upper bound; Computational efficiency; Cost function; Data engineering; Databases; Equations; Information retrieval; Query processing; Scattering; Upper bound;

fLanguage

English

Journal_Title

Knowledge and Data Engineering, IEEE Transactions on

Publisher

ieee

ISSN

1041-4347

Type

jour

DOI

10.1109/69.334866

Filename

334866

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1203288