Efficient Expressions for Completely and Partly Unsuccessful Batched Search of Tree-structured Files

    Authors

    S. D. Lang;Y. Manolopoulos

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Keywords

    Access strategy; batched searching; performance evaluation; physical; database design; sequential and tree-structured files; block accesses; organizations; performance; Computer Science, Software Engineering; Engineering, Electrical &; Electronic

    Abstract

    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.

    Journal Title

    IEEE Transactions on Software Engineering

    Volume

    16

    Issue/Number

    12

    Publication Date

    12-1-1990

    Document Type

    Article

    Language

    English

    First Page

    1433

    Last Page

    1435

    WOS Identifier

    WOS:A1990EP74400011

    ISSN

    1433-1435

    Share

    COinS