We describe a technique for building hash indices for a large dictionary of strings. This technique permits robust retrieval of strings from the dictionary even when the query pattern has a significant number of errors. This technique is closely related to the classical Turan problem for hypergraphs. We propose a general method of multi-index construction by generalizing certain Turan hypergrap...

We present an information-thoeretical viewpoint for similarity-based retrieval along with index structures. This retrieval system has two stages: pruning data items based on the index structures, and matching surviving data items. The first stage is modeled as the Wyner-Ziv problem, while the second stage is considered as a coding problem where some of the decording results are available as par...