Efficient expressions for completely and partly unsuccessful batched search of tree-structured files

Author

Lang, S.D. ; Manolopoulos, Yannis

Author_Institution

Dept. of Comput. Sci., Central Florida Univ., Orlando, FL, USA

Volume

Issue

fYear

1990

fDate

12/1/1990 12:00:00 AM

Firstpage

1433

Lastpage

1435

Abstract

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

Keywords

batch processing (computers); data structures; database management systems; information retrieval systems; search problems; trees (mathematics); block accesses; complete j-ary tree files; hierarchical file structures; nonrecurrent expressions; nonreplacement models; partly unsuccessful batched searching; search queries; Buffer storage; Closed-form solution; Computer science; Costs; Database systems; Probability; Query processing; Relational databases; Tiles;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/32.62451

Filename

62451

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1248725