On Hash-Coding Algorithms for Partial-Match Retrieval (Extended Abstract)

  title={On Hash-Coding Algorithms for Partial-Match Retrieval (Extended Abstract)},
  author={Ronald L. Rivest},
This paper considers several practical heuristics for the design of good, if not optimal, partial-match data bases in situations which are typical of real life information retrieval systems. (Submitted to Information Processing Letters) * Work supported in part by U.S. Energy Research and Development Administration under Contract E(Oh.-3)-515. ** Work supported in part by National Science Foundation Grant GP-8557. -2 

From This Paper

Topics from this paper.
3 Citations
6 References
Similar Papers


Publications citing this paper.


Publications referenced by this paper.
Showing 1-6 of 6 references

NP-completeness of tree structured index minimization

  • D. Comer, R. Sethi
  • Technical report 167,
  • 1975

Partial-match retrieval: performance bounds

  • W. A. Burkhard
  • UCSD Computer Science Division TR
  • 1975

Analysis of associative retrieval algorithms

  • R. L. Rivest
  • Technical report STAN-CS-74-415,
  • 1974

On hash-coding algorithms for partial-match retrieval

  • R. L. Rivest
  • Proceedings of the 15th Annual Symposium on…
  • 1974

Similar Papers

Loading similar papers…