Comments on batched searching of sequential and tree-structured files

1 June 1985

journal article
Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems

Vol. 10 (2) , 285-287
https://doi.org/10.1145/3857.214294

Abstract

Exact formulas for the expected cost savings from batching requests against two types of j-ary trees are given. Approximate expressions are also presented.

Keywords

STRUCTURED
COMMENTS
BATCHED SEARCHING
REQUESTS
FILES
ARY
FORMULAS
SEARCHING OF SEQUENTIAL

This publication has 3 references indexed in Scilit:

A unifying model of physical databases
ACM Transactions on Database Systems, 1982
Batched searching of sequential and tree structured files
ACM Transactions on Database Systems, 1976
Analysis and performance of inverted data base structures
Communications of the ACM, 1975