Non-uniform partial-match file designs

1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

File designs suitable for retrieval from a file of k-letter words when queries may be only partially specified are examined. A class of PMF-tries is introduced which admits closed form analysis of worst case bounds and average case performance. The worst case bounds obtained are seen to be bounds on the worst case performance of even larger families of PMF-designs which have no closed form worst case bounds. The implementation of these designs requires storage essentially equal to that required of the records themselves. © 1977.

Cite

CITATION STYLE

APA

Burkhard, W. A. (1977). Non-uniform partial-match file designs. Theoretical Computer Science, 5(1), 1–23. https://doi.org/10.1016/0304-3975(77)90040-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free