A unified analysis of batched searching of sequential and tree-structured files

Authors:
Sheau-Dong Lang;James R. Driscoll;Jiann H. Jou
Affiliations:
Univ. of Central Florida, Orlando;Univ. of Central Florida, Orlando;Solus Systems, Inc., Lake Oswego, OR
Venue:
ACM Transactions on Database Systems (TODS)
Year:
1989

Citing 19
Cited 2

Expressions for batched searching of sequential and hierarchical files

ACM Transactions on Database Systems (TODS)
Batch insertion for tree structured file organizations—improving differential database representation

Information Systems
Database performance evaluation in an indexed file environment

ACM Transactions on Database Systems (TODS)
Modeling B-tree insertion activity

Information Processing Letters
A general framework for computing block accesses

Information Systems
Comments on batched searching of sequential and tree-structured files

ACM Transactions on Database Systems (TODS)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
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)
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)
The Influence of Data Base Characteristics and Usage on Direct Access File Organization

Journal of the ACM (JACM)
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
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
Database Design

Database Design
Improving the Differential File Technique via Batch Operations for Tree Structured File Organizations

Proceedings of the Second International Conference on Data Engineering

Efficient Expressions for Completely and Partly Unsuccessful Batched Search of Tree-Structured Files

IEEE Transactions on Software Engineering
Index configuration in object-oriented databases

The VLDB Journal — The International Journal on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

A direct and unified approach is used to analyze the efficiency of batched searching of sequential and tree-structured files. The analysis is applicable to arbitrary search distributions, and closed-form expressions are obtained for the expected batched searching cost and savings. In particular, we consider a search distribution satisfying Zipf's law for sequential files and four types of uniform (random) search distribution for sequential and tree-structured files. These results unify and extend earlier research on batched searching and estimating block accesses for database systems.