|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| G. Diehr, A.N. Saharia, "Estimating Block Accesses in Database Organizations," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 3, pp. 497-499, June, 1994. | |||
| BibTex | x | ||
| @article{ 10.1109/69.334866, author = {G. Diehr and A.N. Saharia}, title = {Estimating Block Accesses in Database Organizations}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {6}, number = {3}, issn = {1041-4347}, year = {1994}, pages = {497-499}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.334866}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Knowledge and Data Engineering TI - Estimating Block Accesses in Database Organizations IS - 3 SN - 1041-4347 SP497 EP499 EPD - 497-499 A1 - G. Diehr, A1 - A.N. Saharia, PY - 1994 KW - database management systems; file organisation; errors; performance evaluation; database theory; block access estimation; database organization; disk accesses; record retrieval; Yao function; iterative computations; approximation; errors; upper bound; lower bound; access path selection; physical database design; performance estimation VL - 6 JA - IEEE Transactions on Knowledge and Data Engineering ER - | |||
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.
[1] J. Bradley,File and Database Techniques. New York: Holt, Rinehart and Winston, 1981, pp. 108-110.
[2] A. Cardenas, "Analysis and performance of inverted data-base structures,"Commun. ACM, vol. 18, no. 5, pp. 253-263, 1975.
[3] T. Cheung, "Estimating block accesses and number of records in file management,"Commun. ACM, vol. 25, no. 7, pp. 484-487, July 1982.
[4] L. F. Mackert and G. M. Lohman, "Index scans using a finite LRU buffer: A validated I/O model,"ACM Trans. Database Syst., vol. 14, no. 3, pp. 401-424, Sept. 1989.
[5] D. Severance, "Differential files: their application to the maintenance of large databases,"ACM Trans. Data Base Syst., vol. 1, pp. 256-267, 1976.
[6] S. J. Waters, "Hit ratios,"Comput. J., vol. 19, pp. 21-24, 1976.
[7] K. Whang, G. Wiederhold, and D. Sagalowicz, "Estimating block accesses in database organizations: A closed noniterative formula,"Commun. ACM, vol. 26, no. 11, pp. 940-944, Nov. 1983.
[8] S. B. Yao, "Approximating block accesses in database organizations,"Commun. ACM, vol. 20, pp. 260-261, Apr. 1977.