Efficient Expressions For Completely And Partly Unsuccessful Batched Search Of Tree-Structured Files
Authors: contact us about adding a copy of your work at STARS@ucf.edu
In this correspondence, 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 hierarchial file structures.