Non-Expansive Hashing

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 from a large universe may be stored in a memory of size (any , and ), and where retrieval takes 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.

This is a preview of subscription content, access via your institution.

Author information

Affiliations

Authors

Additional information

Received: February 5, 1996

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Linial, N., Sasson, O. Non-Expansive Hashing. Combinatorica 18, 121–132 (1998). https://doi.org/10.1007/PL00009805

Download citation

  • AMS Subject Classification (1991) Classes:  68R05, 68P05