Neighborhood preserving hashing and approximate queries

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

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations

Abstract

Let D⊂Σn be a dictionary. We look for efficient data structures and algorithms to solve the 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 no more than k buckets; (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
Title of host publicationProceedings of the Annual ACM SIAM Symposium on Discrete Algorithms
PublisherPubl by ACM
Pages251-259
Number of pages9
ISBN (Print)0898713293
StatePublished - 1994
EventProceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms - Arlington, VA, USA
Duration: 23 Jan 199425 Jan 1994

Publication series

NameProceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

Conference

ConferenceProceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms
CityArlington, VA, USA
Period23/01/9425/01/94

Fingerprint

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

Cite this