Expressions for Completely and Partly Unsuccessful Batched Search of Sequential and Tree-Structured Files
Issue No. 06 - June (1989 vol. 15)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.24732
<p>A number of previous studies derived expressions for batched searching of sequential and tree-structured files on the assumption that all the keys in the batch exist in the file, i.e., all the searches are successful. Formulas for batched searching of sequential and tree-structured files are derived, but the assumption made is that either all or part of the keys in the batch do not exist in the file, i.e., the batched search is completely or partly unsuccessful.</p>
completely unsuccessful batched search; partly unsuccessful batched search; batched searching; tree-structured files; batch processing (computers); database management systems; information retrieval
J. Kollias and Y. Manolopoulos, "Expressions for Completely and Partly Unsuccessful Batched Search of Sequential and Tree-Structured Files," in IEEE Transactions on Software Engineering, vol. 15, no. , pp. 794-799, 1989.