Non-expansive hashing

Nathan Linial*, Ori Sasson

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

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(R1-ε) from a large universe may be stored in a memory of size R (any ε > 0, and R > R0(ε)), 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.

Original languageAmerican English
Pages (from-to)121-132
Number of pages12
JournalCombinatorica
Volume18
Issue number1
DOIs
StatePublished - 1998

Fingerprint

Dive into the research topics of 'Non-expansive hashing'. Together they form a unique fingerprint.

Cite this