The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (1990 vol.16)
pp: 1433-1435
ABSTRACT
<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>
INDEX TERMS
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)
CITATION
S.D. Lang, Y. Manolopoulos, "Efficient Expressions for Completely and Partly Unsuccessful Batched Search of Tree-Structured Files", IEEE Transactions on Software Engineering, vol.16, no. 12, pp. 1433-1435, December 1990, doi:10.1109/32.62451
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool