Non-Expansive Hashing
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– C) from a large universe may be stored in a memory of size R (any e > 0, and R > Ro(c)), and where retrieval takes O(1) ope...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
1996
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/sis_research/1250 http://dx.doi.org/10.1145/237814.237999 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |
| id |
sg-smu-ink.sis_research-2249 |
|---|---|
| record_format |
dspace |
| spelling |
sg-smu-ink.sis_research-22492014-03-10T05:44:07Z Non-Expansive Hashing LINIAL, Nathan SASSON, Ori 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– C) from a large universe may be stored in a memory of size R (any e > 0, and R > Ro(c)), 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. 1996-10-01T07:00:00Z text https://ink.library.smu.edu.sg/sis_research/1250 info:doi/10.1145/237814.237999 http://dx.doi.org/10.1145/237814.237999 Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Hash-table representations data storage representations Information storage systems Computer Sciences Systems Architecture |
| institution |
Singapore Management University |
| building |
SMU Libraries |
| continent |
Asia |
| country |
Singapore Singapore |
| content_provider |
SMU Libraries |
| collection |
InK@SMU |
| language |
English |
| topic |
Hash-table representations data storage representations Information storage systems Computer Sciences Systems Architecture |
| spellingShingle |
Hash-table representations data storage representations Information storage systems Computer Sciences Systems Architecture LINIAL, Nathan SASSON, Ori Non-Expansive Hashing |
| description |
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– C) from a large universe may be stored in a memory of size R (any e > 0, and R > Ro(c)), 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. |
| format |
text |
| author |
LINIAL, Nathan SASSON, Ori |
| author_facet |
LINIAL, Nathan SASSON, Ori |
| author_sort |
LINIAL, Nathan |
| title |
Non-Expansive Hashing |
| title_short |
Non-Expansive Hashing |
| title_full |
Non-Expansive Hashing |
| title_fullStr |
Non-Expansive Hashing |
| title_full_unstemmed |
Non-Expansive Hashing |
| title_sort |
non-expansive hashing |
| publisher |
Institutional Knowledge at Singapore Management University |
| publishDate |
1996 |
| url |
https://ink.library.smu.edu.sg/sis_research/1250 http://dx.doi.org/10.1145/237814.237999 |
| _version_ |
1770570928917315584 |