article

Free access

A new hashing function: statistical behaviour and algorithm

Authors:

Zhiyu Tian,

Shibai Tong,

Shiyuan YangAuthors Info & Claims

ACM SIGIR Forum, Volume 27, Issue 1

Pages 3 - 13

https://doi.org/10.1145/174263.174264

Published: 21 March 1993 Publication History

PDF eReader

Abstract

Existing hashing functions have various limitations. In this paper a new hashing function is proposed, which divides the range of the key-values into some equal segments, and maps the key-values in each segment linearly into the whole range of the address. The paper analyzes the statistical behavior of the function, and points out that, theoretically, by increasing the number of segments, the distribution of the resulting hash values can always approach uniform, if the key-values can be regarded as continuous. Two methods for obtaining the number of segments, the deterministic and the probabilistic, along with the algorithm, are also proposed.

References

[1]

R. J. Cichelli, Minimal perfect hash functions made simple, Communications of the ACM, Vol. 23, No. 1, pp 17--19, January 1980

Digital Library

Google Scholar

[2]

E. A. Fox, et al, Practical minimal perfect hush functions for large databases, Communications of ACM, Vol. 35, No. 1, pp 105--121, January 1992

Digital Library

Google Scholar

[3]

E. Hill, Jr., A comparative study on very large databases, Springer-Verlag, 1978

Digital Library

Google Scholar

[4]

G. D. Knott, Hashing functions, The Computer Journal, Vol. 18, No. 1, pp 265--278, 1975

Google Scholar

[5]

R. J. Larsen and M. L. Marx, An introduction to mathematical statistics and its applications, Prentice Hall, England Cliffs, New Jersey, 1986

Google Scholar

[6]

P. K. Pearson, Fast hashing of variable-length text strings, Communications of ACM, Vol. 33, No. 6, pp 679--680, June 1990

Digital Library

Google Scholar

[7]

Z. Y. Tian and S. B. Tong, An easy-to-compute general purpose hashing function, Advances in Modelling Analysis, B, Vol. 25, No. 1, pp 11--18, 1993

Google Scholar

[8]

H. L. Wu, Database principle and design (in Chinese), Chinese National Defence Industry Press, 1987

Google Scholar

Index Terms

A new hashing function: statistical behaviour and algorithm
1. Information systems
  1. Information retrieval
  2. Information storage systems
    1. Record storage systems
      1. Record storage alternatives
        Hashed file organization
        Indexed file organization

Recommendations

Zing Database: high-performance key-value store for large-scale storage service

Nowadays, key-value stores play an important role in cloud storage services and large-scale high-performance applications. This paper proposes a new approach in design key-value store and presents Zing Database (ZDB) which is a high-performance ...
SifrDB: A Unified Solution for Write-Optimized Key-Value Stores in Large Datacenter
SoCC '18: Proceedings of the ACM Symposium on Cloud Computing

Key-value (KV) stores based on multi-stage structures are widely deployed in the cloud to ingest massive amounts of easily searchable user data. However, current KV storage systems inevitably sacrifice at least one of the performance objectives, such as ...
New file organization based on dynamic hashing

New file organizations based on hashing and suitable for data whose volume may vary rapidly recently appeared in the literature. In the three schemes which have been independently proposed, rehashing is avoided, storage space is dynamically adjusted to ...

Comments

Information & Contributors

Information

Published In

ACM SIGIR Forum Volume 27, Issue 1

Spring 1993

45 pages

ISSN:0163-5840

DOI:10.1145/174263

Editors:
William B. Frakes
VPI & State Univ., Falls Church, VA
,
Christopher J. Fox
James Madison Univ., Harrisonburg, VA

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 March 1993

Published in SIGIR Volume 27, Issue 1

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
209
Total Downloads

Downloads (Last 12 months)19
Downloads (Last 6 weeks)7

Reflects downloads up to 18 Aug 2024

Other Metrics

View Author Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Index Terms

Recommendations

Zing Database: high-performance key-value store for large-scale storage service

SifrDB: A Unified Solution for Write-Optimized Key-Value Stores in Large Datacenter

New file organization based on dynamic hashing

Comments

Information

Published In

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations