Approximating block accesses in database organizations
- 1 April 1977
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 20 (4), 260-261
- https://doi.org/10.1145/359461.359475
Abstract
When data records are grouped into blocks in secondary storage, it is frequently necessary to estimate the number of blocks X D accessed for a given query. In a recent paper [1], Cardenas gave the expression X D = m (1 - (1 - 1/ m ) k ), (1) assuming that there are n records divided into m blocks and that the k records satisfying the query are distributed uniformly among the m blocks. The derivation of the expression was left to the reader as an exercise.Keywords
This publication has 5 references indexed in Scilit:
- An attribute based model for database access cost analysisACM Transactions on Database Systems, 1977
- A stochastic evaluation model for database organizations in data retrieval systemsCommunications of the ACM, 1976
- Analysis and performance of inverted data base structuresCommunications of the ACM, 1975
- Tree structures construction using key densitiesPublished by Association for Computing Machinery (ACM) ,1975
- Attribute based file organization in a paged memory environmentCommunications of the ACM, 1974