Expressions for Batched Searching of Sequential and Hierarchical Files

UNCG Author/Contributor (non-UNCG co-authors, if there are any, appear on document)
Prashant Palvia, Joe Rosenthal Excellence Professor and Director of the McDowell Research Center for Global IT Management (Creator)
The University of North Carolina at Greensboro (UNCG )
Web Site:

Abstract: 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 file. The advantages of batching for sequential and random files are discussed. A direct equation is provided for the number of nodes accessed in unbatched 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.

Additional Information

ACM Transactions on Database Systems, March, 1985, Vol. 10, No. 1, pp. 97-106.
Language: English
Date: 1985
terformance, theory, database design, physical design, files, block accesses, sequential search, number of records, access paths

Email this document to