Approximating block accesses in database organizations
Information Processing Letters
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)
A Practical Approach to Selecting Record Access Paths
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
A formal system for information retrieval from files
Communications of the ACM
Some generalized modeling structures for use in design of file organizations.
Some generalized modeling structures for use in design of file organizations.
Database performance evaluation in an indexed file environment
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)
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Efficient Expressions for Completely and Partly Unsuccessful Batched Search of Tree-Structured Files
IEEE Transactions on Software Engineering
Analytical modeling of materialized view maintenance
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Sampling from databases using B+-trees
Proceedings of the ninth international conference on Information and knowledge management
TBSAM: An Access Method for Efficient Processing of Statistical Queries
IEEE Transactions on Knowledge and Data Engineering
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Random sampling from database files: a survey
SSDBM'1990 Proceedings of the 5th international conference on Statistical and Scientific Database Management
Sampling from databases using B$^+$-Trees
Intelligent Data Analysis
| Hi-index | 0.00 |
Batching yields significant savings in access costs in sequential, tree structured, and random files. A direct and simple expression is developed for computing the average number of records/pages accessed to satisfy a batched query of a sequential tile. The advantages of batching for sequential and random files are discussed. A direct equation is provided for the number of nodes accessed in unhatched queries of hierarchical files. An exact recursive expression is developed for node accesses in batched queries of hierarchical files. In addition to the recursive relationship, good, closed-form upper- and lower-bound approximations are provided for the case of batched queries of hierarchical files.