Neighborhood preserving hashing and approximate queries

Danny Dolev*, Yuval Harari, Nathan Linial, Noam Nisan, Michal Parnas

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

Let D ⊆ ∑n be a dictionary. We look for efficient data structures and algorithms to solve the following approximate query problem: Given a query u ∈ ∑n list all words v ∈ D that are close to u in Hamming distance. The problem reduces to the following combinatorial problem: Hash the vertices of the n-dimensional hypercube into buckets so that (1) the c-neighborhood of each vertex is mapped into at most k buckets and (2) no bucket is too large. Lower and upper bounds are given for the tradeoff between k and the size of the largest bucket. These results are used to derive bounds for the approximate query problem.

Original languageAmerican English
Pages (from-to)73-85
Number of pages13
JournalSIAM Journal on Discrete Mathematics
Volume15
Issue number1
DOIs
StatePublished - 2002

Keywords

  • Approximate query
  • Error correcting code
  • Hashing
  • Isoperimetric inequality

Fingerprint

Dive into the research topics of 'Neighborhood preserving hashing and approximate queries'. Together they form a unique fingerprint.

Cite this