Neighborhood preserving hashing and approximate queries

Danny Dolev; Yuval Harari; Nathan Linial; Noam Nisan; Michal Parnas

Neighborhood preserving hashing and approximate queries

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

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

15 Scopus citations

Abstract

Let D⊂Σⁿ be a dictionary. We look for efficient data structures and algorithms to solve the approximate query problem: Given a query u ∈ Σⁿ 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 language	English
Title of host publication	Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms
Publisher	Publ by ACM
Pages	251-259
Number of pages	9
ISBN (Print)	0898713293
State	Published - 1994
Event	Proceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms - Arlington, VA, USA Duration: 23 Jan 1994 → 25 Jan 1994

Publication series

Name	Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

Conference

Conference	Proceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms
City	Arlington, VA, USA
Period	23/01/94 → 25/01/94

Cite this

@inproceedings{78f95d1491de4b2ba544b76b151a8693,

title = "Neighborhood preserving hashing and approximate queries",

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.",

author = "Danny Dolev and Yuval Harari and Nathan Linial and Noam Nisan and Michal Parnas",

year = "1994",

language = "אנגלית",

isbn = "0898713293",

series = "Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms",

publisher = "Publ by ACM",

pages = "251--259",

booktitle = "Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms",

note = "Proceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms ; Conference date: 23-01-1994 Through 25-01-1994",

}

Dolev, D, Harari, Y, Linial, N , Nisan, N & Parnas, M 1994, Neighborhood preserving hashing and approximate queries. in Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, Publ by ACM, pp. 251-259, Proceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms, Arlington, VA, USA, 23/01/94.

Neighborhood preserving hashing and approximate queries. / Dolev, Danny; Harari, Yuval; Linial, Nathan et al.
Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. Publ by ACM, 1994. p. 251-259 (Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Neighborhood preserving hashing and approximate queries

AU - Dolev, Danny

AU - Harari, Yuval

AU - Linial, Nathan

AU - Nisan, Noam

AU - Parnas, Michal

PY - 1994

Y1 - 1994

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028257898&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0028257898

SN - 0898713293

T3 - Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

SP - 251

EP - 259

BT - Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms

PB - Publ by ACM

T2 - Proceedings of the Fifth Annual SIAM Symposium on Discrete Algorithms

Y2 - 23 January 1994 through 25 January 1994

ER -

Neighborhood preserving hashing and approximate queries

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this