Approximating block accesses in database organizations
Information Processing Letters
Expressions for batched searching of sequential and hierarchical files
ACM Transactions on Database Systems (TODS)
Searching for composite queries in a main memory database
Angewandte Informatik
Performance of a two-headed disk system when serving database queries under the scan policy
ACM Transactions on Database Systems (TODS)
Probability distributions for seek time evaluation
Information Sciences: an International Journal
Comments on batched searching of sequential and tree-structured files
ACM Transactions on Database Systems (TODS)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A unifying model of physical databases
ACM Transactions on Database Systems (TODS)
Batched searching of sequential and tree structured files
ACM Transactions on Database Systems (TODS)
An attribute based model for database access cost analysis
ACM Transactions on Database Systems (TODS)
Estimating block accesses in database organizations: a closed noniterative formula
Communications of the ACM
On estimating block accesses in database organizations
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
Design of Database Structures
Estimating block transfers and join sizes
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
Efficient Expressions for Completely and Partly Unsuccessful Batched Search of Tree-Structured Files
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
A number of previous studies derived expressions for batched searching of sequential and tree-structured files on the assumption that all the keys in the batch exist in the file, i.e., all the searches are successful. Formulas for batched searching of sequential and tree-structured files are derived, but the assumption made is that either all or part of the keys in the batch do not exist in the file, i.e., the batched search is completely or partly unsuccessful.