Expressions for batched searching of sequential and hierarchical files
ACM Transactions on Database Systems (TODS)
A general framework for computing block accesses
Information Systems
Index scans using a finite LRU buffer: a validated I/O model
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)
Comments on batched searching of sequential and tree-structured files
ACM Transactions on Database Systems (TODS)
Implications of certain assumptions in database performance evauation
ACM Transactions on Database Systems (TODS)
Query processing in a system for distributed databases (SDD-1)
ACM Transactions on Database Systems (TODS)
Batched searching of sequential and tree structured files
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
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
Design of Database Structures
Access path selection in a relational database management system
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
| Hi-index | 0.00 |
Closed-form, nonrecurrent expressions for the cost of completely and partly unsuccessful batched searching are developed for complete j-ary tree files. These expressions are applied to both the replacement and nonreplacement models of the search queries. The expressions provide more efficient formulas than previously reported for calculating the cost of batched searching. The expressions can also be used to estimate the number of block accesses for hierarchical file structures.