Efficient Expressions for Completely and Partly Unsuccessful Batched Search of Tree-Structured Files
Issue No. 12 - December (1990 vol. 16)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.62451
<p>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.</p>
nonrecurrent expressions; partly unsuccessful batched searching; complete j-ary tree files; nonreplacement models; search queries; block accesses; hierarchical file structures; batch processing (computers); data structures; database management systems; information retrieval systems; search problems; trees (mathematics)
S. Lang and Y. Manolopoulos, "Efficient Expressions for Completely and Partly Unsuccessful Batched Search of Tree-Structured Files," in IEEE Transactions on Software Engineering, vol. 16, no. , pp. 1433-1435, 1990.