Efficient expressions for completely and partly unsuccessful batched search of tree-structured files
Sheau-Dong Lang, Yannis Manolopoulos · IEEE Transactions on Software Engineering · 1990
Closed-form, nonrecurrent expressions for the cost of completely and partly unsuccessful batched searching are developed for complete j-ary tree files. These expressions are applied to both the replacement and nonreplacement models of the search queries. The expressions provide more efficient formulas than previously reported for calculating the cost of batched searching. The expressions can also be used to estimate the number of block accesses for hierarchical file structures.>