Approximating block accesses in database organizations
Communications of the ACM
A stochastic evaluation model for database organizations in data retrieval systems
Communications of the ACM
Analysis and performance of inverted data base structures
Communications of the ACM
Index selection in a self-adaptive data base management system
SIGMOD '76 Proceedings of the 1976 ACM SIGMOD international conference on Management of data
Expressions for batched searching of sequential and hierarchical files
ACM Transactions on Database Systems (TODS)
Database performance evaluation in an indexed file environment
ACM Transactions on Database Systems (TODS)
On estimating the cardinality of the projection of a database relation
ACM Transactions on Database Systems (TODS)
Statistical profile estimation in database systems
ACM Computing Surveys (CSUR)
Index scans using a finite LRU buffer: a validated I/O model
ACM Transactions on Database Systems (TODS)
Performance of a two-headed disk system when serving database queries under the scan policy
ACM Transactions on Database Systems (TODS)
IEEE Transactions on Software Engineering
A unified analysis of batched searching of sequential and tree-structured files
ACM Transactions on Database Systems (TODS)
Efficient Expressions for Completely and Partly Unsuccessful Batched Search of Tree-Structured Files
IEEE Transactions on Software Engineering
Query-processing optimization strategies: feasible vs optimal solutions
ACM '85 Proceedings of the 1985 ACM annual conference on The range of computing : mid-80's perspective: mid-80's perspective
Query Optimization in Database Systems
ACM Computing Surveys (CSUR)
On estimating block accesses in database organizations
Communications of the ACM
Estimating block transfers and join sizes
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Estimating Block Selectivities for Physical Database Design
IEEE Transactions on Knowledge and Data Engineering
Estimating Block Accesses in Database Organizations
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 48.23 |
We consider the problems of estimating the number of secondary storage blocks and the number of distinct records accessed when a transaction consisting of possibly duplicate requested records is presented to a file management system. Our main results include (1) a new formula for block access estimation for the case where the requested records may have duplications and their ordering in immaterial and (2) a simple formula for estimating the number of distinct records in the transaction.