Title

Efficient Expressions For Completely And Partly Unsuccessful Batched Search Of Tree-Structured Files

Keywords

Access strategy; batched searching; performance evaluation; physical database design; sequential and tree-structured files

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 hierarchical file structures. © 1990 IEEE

Publication Date

1-1-1990

Publication Title

IEEE Transactions on Software Engineering

Volume

16

Issue

12

Number of Pages

1433-1435

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/32.62451

Socpus ID

0025554105 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/0025554105

This document is currently not available here.

Share

COinS