Estimating block accesses in database organizations
- 1 November 1983
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 26 (11) , 940-944
- https://doi.org/10.1145/182.358452
Abstract
A closed, noniterative formula is introduced for estimating the number of block accesses in a database organization, and the error analyzed. This formula, an approximation of Yao's exact formula, has a maximum error of 3.7 percent, and significantly reduces the computation time by eliminating the iterative loop. It also achieves a much higher accuracy than an approximation proposed by Cardenas.Keywords
This publication has 10 references indexed in Scilit:
- On estimating block accesses in database organizationsCommunications of the ACM, 1983
- Query processing in a system for distributed databases (SDD-1)ACM Transactions on Database Systems, 1981
- Optimization of query evaluation algorithmsACM Transactions on Database Systems, 1979
- Approximating block accesses in database organizationsCommunications of the ACM, 1977
- A stochastic evaluation model for database organizations in data retrieval systemsCommunications of the ACM, 1976
- Storage cost considerations in secondary index selectionInternational Journal of Parallel Programming, 1975
- Analysis and performance of inverted data base structuresCommunications of the ACM, 1975
- Estimating magnetic disc seeksThe Computer Journal, 1975
- Attribute based file organization in a paged memory environmentCommunications of the ACM, 1974
- File Design FallaciesThe Computer Journal, 1972