research-article

Free access

Expandable open addressing hash table storage and retrieval

Author:

Gary D. KnottAuthors Info & Claims

SIGFIDET '71: Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control

Pages 187 - 206

https://doi.org/10.1145/1734714.1734729

Published: 11 November 1971 Publication History

PDF eReader

References

[1]

Bell, James R., and Kaman, Charles H., "The Linear Quotient Hash Code," CACM, Vol. 13, No. 11, pp 675:677, November 1970.

Digital Library

Google Scholar

[2]

Coffman, Edward G. Jr., and Eve, J., "File Structures Using Hashing Functions," CACM, Vol. 13, No. 7, pp 427:432, 436, July 1970.

Digital Library

Google Scholar

[3]

Day, A. Colin, "Full Table Quadratic Searching for Scatter Storage," CACM, Vol. 13, No. 8, pp 481:482, August 1970.

Digital Library

Google Scholar

[4]

Hanan, Maurice and Palermo, Frank P., "An Application of Coding Theory to a File Address Problem," IBM J. of R. and D., Vol. 7, No. 2, pp 127:129, April 1963.

Digital Library

Google Scholar

[5]

Hardy, G. H., and Wright, E. M., An Introduction to the Theory of Numbers, Fourth edition, Oxford, 1960.

Google Scholar

[6]

Hopgood, F. R. A., "A Solution for the Table Overflow Problem for Hash Tables," The Computer Bulletin, Vol. 11, No. 4, pp 297:300, March 1968.

Google Scholar

[7]

Isaac, E. J., and Singleton, Richard D., "Sorting by Address Calculation," JACM, Vol. 3, No. 3, pp 169:174, July 1956.

Digital Library

Google Scholar

[8]

Knott, Gary D., "A Balanced Tree Storage and Retrieval Algorithm," Proc. ACM Symposium on Inf. Storage and Retrieval, pp 175:195, University of Maryland, 1971.

Digital Library

Google Scholar

[9]

Knuth, Donald E., The Art of Computer Programming, Vol. 2: Seminumerical Algorithms, Addison Wesley, Reading, Mass., 1969.

Digital Library

Google Scholar

[10]

Král, J. "Some Properties of the Scatter Storage Technique with Linear Probing," C. J., Vol. 14, No. 2, pp 145:149, May 1971.

Google Scholar

[11]

Kronmal, Richard A., and Tarter, Michael E., "Cumulative Polygon Address Calculation Sorting," Proc. of the 20th Natl. ACM Conf. at Cleveland, pp 376:384, 1965.

Digital Library

Google Scholar

[12]

Maurer, Ward Douglas, "An Improved Hash Code for Scatter Storage," CACM, Vol. 11, No. 1, pp 35:38, January 1968.

Digital Library

Google Scholar

[13]

Morris, Robert, "Scatter Storage Techniques," CACM, Vol. 11, No. 1, pp 38:44, January 1968.

Digital Library

Google Scholar

[14]

Olson, C. A., "Random Access File Organization for Indirectly Addressed Records," Proc. ACM 24th Natl. Conf., pp 539:549, ACM, N.Y., 1969.

Digital Library

Google Scholar

[15]

Peterson, W. Wesley, "Addressing for Random Access Storage," IBM J. of R. and D., Vol. 1, No. 2, pp 130:146, April 1957.

Digital Library

Google Scholar

[16]

Radke, Charles E., "The Use of Quadratic Residue Research," CACM, Vol. 13, No. 2, pp 103:105, February 1970.

Digital Library

Google Scholar

[17]

Shapiro, Robert M.; Saint, Harry; Millstein, Robert T.; Holt, Anatol W.; Warshall, Stephen; and Sempliner, Louis, A Handbook on File Structuring, ADR Inc. Report RADC-TR-69-313, Vol. 1, September 1969, Federal Clearinghouse No. AD697025.

Crossref

Google Scholar

[18]

Tarter, Michael E., and Kronmal, Richard A., "Estimation of the Cumulative by Fourier Series Methods and Application to the Insertion Problem," Proc. of the 23rd National ACM Conf., pp 491:497, ACM, 1968.

Digital Library

Google Scholar

Cited By

View all

Nam MCha HChoi YNoh SNam BMerchant AWeatherspoon H(2019)Write-optimized dynamic hashing for persistent memoryProceedings of the 17th USENIX Conference on File and Storage Technologies10.5555/3323298.3323302(31-44)Online publication date: 25-Feb-2019
https://dl.acm.org/doi/10.5555/3323298.3323302
Kidon MDobai R(2017)Evolutionary design of hash functions for IP address hashing using genetic programming2017 IEEE Congress on Evolutionary Computation (CEC)10.1109/CEC.2017.7969509(1720-1727)Online publication date: Jun-2017
https://doi.org/10.1109/CEC.2017.7969509
Sorenson PTremblay JDeutscher R(2016)Key-To-Address Transformation TechniquesINFOR: Information Systems and Operational Research10.1080/03155986.1978.1173168516:1(1-34)Online publication date: 25-May-2016
https://doi.org/10.1080/03155986.1978.11731685
Show More Cited By

Expandable open addressing hash table storage and retrieval
1. Information systems
  1. Information storage systems
    1. Record storage systems
      1. Record storage alternatives

Recommendations

Addressing CBIR efficiency, effectiveness, and retrieval subjectivity simultaneously
MIR '03: Proceedings of the 5th ACM SIGMM international workshop on Multimedia information retrieval

This work is about Content Based Image Retrieval (CBIR), focusing on developing a Fast And Semantics-Tailored (FAST) image retrieval methodology. Specifically, the contributions of FAST methodology to the CBIR literature include: (1) development of a ...
New Attacks on the Concatenation and XOR Hash Combiners
Proceedings, Part I, of the 35th Annual International Conference on Advances in Cryptology --- EUROCRYPT 2016 - Volume 9665

We study the security of the concatenation combiner $$H_1M \Vert H_2M$$H1Mï źH2M for two independent iterated hash functions with n-bit outputs that are built using the Merkle-Damgård construction. In 2004 Joux showed that the concatenation combiner of ...
Rebound attacks on the reduced grøstl hash function
CT-RSA'10: Proceedings of the 2010 international conference on Topics in Cryptology

Grøstl is one of 14 second round candidates of the NIST SHA-3 competition. Cryptanalytic results on the wide-pipe compression function of Grøstl-256 have already been published. However, little is known about the hash function, arguably a much more ...

Comments

Information & Contributors

Information

Published In

SIGFIDET '71: Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control

November 1971

368 pages

ISBN:9781450373005

DOI:10.1145/1734714

Conference Chair:
Edgar F. Codd
IBM Research, San Jose, California
,
Program Chair:
Albert L. Dean
Logicon, Incorporated, San Diego, CA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 November 1971

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
408
Total Downloads

Downloads (Last 12 months)84
Downloads (Last 6 weeks)10

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Nam MCha HChoi YNoh SNam BMerchant AWeatherspoon H(2019)Write-optimized dynamic hashing for persistent memoryProceedings of the 17th USENIX Conference on File and Storage Technologies10.5555/3323298.3323302(31-44)Online publication date: 25-Feb-2019
https://dl.acm.org/doi/10.5555/3323298.3323302
Kidon MDobai R(2017)Evolutionary design of hash functions for IP address hashing using genetic programming2017 IEEE Congress on Evolutionary Computation (CEC)10.1109/CEC.2017.7969509(1720-1727)Online publication date: Jun-2017
https://doi.org/10.1109/CEC.2017.7969509
Sorenson PTremblay JDeutscher R(2016)Key-To-Address Transformation TechniquesINFOR: Information Systems and Operational Research10.1080/03155986.1978.1173168516:1(1-34)Online publication date: 25-May-2016
https://doi.org/10.1080/03155986.1978.11731685
Fu WBen Abraham HCrowley PBrebner GBachmutsky ADas C(2015)Synchronizing Namespaces with Invertible Bloom FiltersProceedings of the Eleventh ACM/IEEE Symposium on Architectures for networking and communications systems10.5555/2772722.2772740(123-134)Online publication date: 7-May-2015
https://dl.acm.org/doi/10.5555/2772722.2772740
Fu WAbraham HCrowley P(2015)Synchronizing namespaces with invertible bloom filters2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS)10.1109/ANCS.2015.7110126(123-134)Online publication date: May-2015
https://doi.org/10.1109/ANCS.2015.7110126
Gandhi RGupta APovzner ABelluomini WKaldewey TKat RBaker MToledo S(2013)MercuryProceedings of the 6th International Systems and Storage Conference10.1145/2485732.2485746(1-6)Online publication date: 30-Jun-2013
https://dl.acm.org/doi/10.1145/2485732.2485746
Samet H(2004)Decoupling partitioning and groupingACM Transactions on Database Systems10.1145/1042046.104205229:4(789-830)Online publication date: 12-Dec-2004
https://dl.acm.org/doi/10.1145/1042046.1042052
Samet H(1986)Bibliography on quadtrees and related hierarchical data structuresData Structures for Raster Graphics10.1007/978-3-642-71071-1_11(181-201)Online publication date: 1986
https://doi.org/10.1007/978-3-642-71071-1_11
Litwin WTeorey TLien Y(1981)Trie hashingProceedings of the 1981 ACM SIGMOD international conference on Management of data10.1145/582318.582322(19-29)Online publication date: 29-Apr-1981
https://dl.acm.org/doi/10.1145/582318.582322
Tamminen M(1981)Order preserving extendible hashing and bucket triesBIT10.1007/BF0193283921:4(419-435)Online publication date: Dec-1981
https://doi.org/10.1007/BF01932839
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Recommendations

Addressing CBIR efficiency, effectiveness, and retrieval subjectivity simultaneously

New Attacks on the Concatenation and XOR Hash Combiners

Rebound attacks on the reduced grøstl hash function