ACM Home Page
Please provide us with feedback. Feedback
Approximating block accesses in database organizations
Full text PdfPdf (183 KB)
Source
Communications of the ACM archive
Volume 20 ,  Issue 4  (April 1977) table of contents
Pages: 260 - 261  
Year of Publication: 1977
ISSN:0001-0782
Author
S. B. Yao  Purdue Univ., West Lafayette, IN
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 70,   Citation Count: 149
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/359461.359475
What is a DOI?

ABSTRACT

When data records are grouped into blocks in secondary storage, it is frequently necessary to estimate the number of blocks XD accessed for a given query. In a recent paper [1], Cardenas gave the expression XD = 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.



CITED BY  149