• DOI:10.1145/258533.258656
Corpus ID: 15693787

Locality-preserving hashing in multidimensional spaces

@inproceedings{Indyk1997LocalitypreservingHI,
  title={Locality-preserving hashing in multidimensional spaces},
  author={P. Indyk and R. Motwani and P. Raghavan and S. Vempala},
  booktitle={STOC '97},
  year={1997}
}

• P. Indyk, R. Motwani, +1 author S. Vempala
• Published in STOC '97 1997
• Mathematics, Computer Science

View on ACM

arl.wustl.edu

Save to Library

Create Alert

Cite

Launch Research Feed

We consider localitg-preserving hashing — in which adjacent points in the domain are mapped to adjacent or nearlyadjacent points in the range — when the domain is a ddimensional cube. This problem has applications to highdimensional search and multimedia indexing. We show that simple and natural classes of hash functions are provably good for this problem. We complement this with lower bounds suggesting that our results are essentially the best possible.