Non-Expansive Hashing (1996)
by
Nathan Linial
,
Ori Sasson
| Venue: | In Proc. 28th STOC |
| Citations: | 30 - 0 self |
BibTeX
@INPROCEEDINGS{Linial96non-expansivehashing,
author = {Nathan Linial and Ori Sasson},
title = {Non-Expansive Hashing},
booktitle = {In Proc. 28th STOC},
year = {1996},
pages = {509--518}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In a non-expansive hashing scheme, similar inputs are stored in memory locations which are close. We develop a non-expansive hashing scheme wherein any set of size O(R 1\Gamma" ) from a large universe may be stored in a memory of size R (any " ? 0, and R ? R 0 (ffl)), and where retrieval takes O(1) operations. We explain how to use non-expansive hashing schemes for efficient storage and retrieval of noisy data. A dynamic version of this hashing scheme is presented as well. 1
Citations
| 590 | Universal classes of hash functions - CARTER, WEGMAN - 1979 |
| 170 | Sparse Distributed Memory - Kanerva - 1988 |
| 25 | Multi-index hashing for information retrieval - Greene, Parnas, et al. - 1994 |
| 19 | Szemeredi: Storing a sparse table with O(1) worst case access time - Fredman, Komlos, et al. - 1984 |
| 14 | Finding the neighborhood of a query in a dictionary - Dolev, Harari, et al. - 1993 |
| 4 | Robust Algorithms and Data Structures for Information Retrieval - Parnas - 1994 |
| 2 | Nisan N., Parnas M., Neighborhood preserving hashing and approximate - Dolev, Harari, et al. - 1994 |
| 1 | auf der Heide F., Rohnert H., Tarjan R. E., Dynamic Perfect Hashing: Upper and Lower Bounds - Dietzfelbinger, Karlin, et al. - 1988 |
