论文信息 - Partial match retrieval

Partial match retrieval

The study of partial match file designs is continued. This study is concerned with a class of file designs which properly contains theABD designs of Rivest. A new family of partial match files is presented, the worst case performance is determined, and the implementation of these files is discussed.

Walter A. Burkhard

[1] David M. Jackson,et al. Classification, Relevance, and Information Retrieval , 1971, Adv. Comput..

[2] Walter A. Burkhard,et al. Some approaches to best-match file searching , 1973, Commun. ACM.

[3] Ronald L. Rivest. On Hash-Coding Algorithms for Partial-Match Retrieval (Extended Abstract) , 1974, SWAT.

[4] Sakti P. Ghosh,et al. File Organization Schemes Based on Finite Geometries , 1968, Inf. Control..

[5] Eugene Wong,et al. Canonical structure in attribute based file organization , 1971, CACM.