Estimating Block Accesses in Database Organizations

Authors:
G. Diehr;A. N. Saharia
Affiliations:
-;-
Venue:
IEEE Transactions on Knowledge and Data Engineering
Year:
1994

Citing 7
Cited 3

Index scans using a finite LRU buffer: a validated I/O model

ACM Transactions on Database Systems (TODS)
Differential files: their application to the maintenance of large databases

ACM Transactions on Database Systems (TODS)
Estimating block accesses in database organizations: a closed noniterative formula

Communications of the ACM
Estimating block accesses and number of records in file management

Communications of the ACM
Approximating block accesses in database organizations

Communications of the ACM
Analysis and performance of inverted data base structures

Communications of the ACM
File and Data Base Techniques

File and Data Base Techniques

A Comprehensive Analytical Performance Model for Disk Devices under Random Workloads

IEEE Transactions on Knowledge and Data Engineering
On the Independence of Data Warehouse from Databases in Maintaining Join Views

DaWaK '99 Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery
Buffer performance modeling in the context of unclustered index accesses with non-uniform access pattern

Information Sciences—Informatics and Computer Science: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.