Non-expansive hashing

Nathan Linial; Ori Sasson

doi:10.1145/237814.237999

Non-expansive hashing

Nathan Linial, Ori Sasson

The Rachel and Selim Benin School of Engineering and Computer Science

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

23 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(R^1-ϵ) from a large universe may be stored in a memory of size R (any ϵ > 0, and R > R₀(ϵ)), and where retrieval takes 0(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 language	English
Title of host publication	Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996
Publisher	Association for Computing Machinery
Pages	509-518
Number of pages	10
ISBN (Electronic)	0897917855
DOIs	https://doi.org/10.1145/237814.237999
State	Published - 1 Jul 1996
Event	28th Annual ACM Symposium on Theory of Computing, STOC 1996 - Philadelphia, United States Duration: 22 May 1996 → 24 May 1996

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
Volume	Part F129452
ISSN (Print)	0737-8017

Conference

Conference	28th Annual ACM Symposium on Theory of Computing, STOC 1996
Country/Territory	United States
City	Philadelphia
Period	22/05/96 → 24/05/96

Bibliographical note

Publisher Copyright:
© 1996 ACM.

Access to Document

10.1145/237814.237999

Cite this

@inproceedings{30d7cdde200f4fc388ecf9daea275c03,

title = "Non-expansive hashing",

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

author = "Nathan Linial and Ori Sasson",

note = "Publisher Copyright: {\textcopyright} 1996 ACM.; 28th Annual ACM Symposium on Theory of Computing, STOC 1996 ; Conference date: 22-05-1996 Through 24-05-1996",

year = "1996",

month = jul,

day = "1",

doi = "10.1145/237814.237999",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "509--518",

booktitle = "Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996",

}

Linial, N & Sasson, O 1996, Non-expansive hashing. in Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996. Proceedings of the Annual ACM Symposium on Theory of Computing, vol. Part F129452, Association for Computing Machinery, pp. 509-518, 28th Annual ACM Symposium on Theory of Computing, STOC 1996, Philadelphia, United States, 22/05/96. https://doi.org/10.1145/237814.237999

Non-expansive hashing. / Linial, Nathan; Sasson, Ori.
Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996. Association for Computing Machinery, 1996. p. 509-518 (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F129452).

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

TY - GEN

T1 - Non-expansive hashing

AU - Linial, Nathan

AU - Sasson, Ori

PY - 1996/7/1

Y1 - 1996/7/1

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

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

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

U2 - 10.1145/237814.237999

DO - 10.1145/237814.237999

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

AN - SCOPUS:0029703221

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 509

EP - 518

BT - Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996

PB - Association for Computing Machinery

T2 - 28th Annual ACM Symposium on Theory of Computing, STOC 1996

Y2 - 22 May 1996 through 24 May 1996

ER -

Non-expansive hashing

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this