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.
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