The DOI matches its Crossref record.
Partial-Match Retrieval Algorithms
Abstract
We examine the efficiency of hash-coding and tree-search algorithms for retrieving from a file of k-letter words all words which match a partially-specified input query word (for example, retrieving all six-letter English words of the form S**R*H where “*” is a “don’t care” character). We precisely characterize those balanced hash-coding algorithms with minimum average number of lists examined. Use of the first few letters of each word as a list index is shown to be one such optimal algorithm. A new class of combinatorial designs (called associative block designs) provides better hash functions with a greatly reduced worst-case number of lists examined, yet with optimal average behavior maintained. Another efficient variant involves storing each word in several lists. Tree-search algorithms are shown to be approximately as efficient as hash-coding algorithms, on the average. In general, these algorithms require time about $O(n^{(k - s)/k} )$ to respond to a query word with s letters specified, given a file of nk-letter words. Previous algorithms either required time $O(s \cdot n/k)$ or else used exorbitant amounts of storage.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Data Structures for Range Searching
Bentley, J. L., & Friedman, J. H. (1979) · ACM Computing Surveys · doi:10.1145/356789.356797 · Cited by 622
Multidimensional Binary Search Trees in Database Applications
Bentley, J. L. (1979) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1979.234200 · Cited by 410
A new algorithm for optimal 2-constraint satisfaction and its implications
Williams, R. (2005) · Theoretical Computer Science · doi:10.1016/j.tcs.2005.09.023 · Cited by 386
Decomposable searching problems
Bentley, J. L. (1979) · Information Processing Letters · doi:10.1016/0020-0190(79)90117-0 · Cited by 340
WHAM: a high-throughput sequence alignment method
Li, Y., Terrell, A., & Patel, J. M. (2011) · Proceedings of the 2011 ACM SIGMOD International Conference on Management of data · doi:10.1145/1989323.1989370 · Cited by 36
Metadata
- Authors
- Rivest, R. L.
- Venue
- SIAM Journal on Computing
- Published
- 1976-03
- Volume
- 5
- Issue
- 1
- Pages
- 19-50
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2155631901
- Cited by
- 244
- References
- 0
- FWCI
- 12.60
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Partial-Match Retrieval Algorithms. https://app.cochat.ai/papers/10.1137/0205003
- The paper
- Rivest, R. L. (1976). Partial-Match Retrieval Algorithms. SIAM Journal on Computing. https://doi.org/10.1137/0205003
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.