The study of an ordered minimal perfect hashing scheme

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The study of an ordered minimal perfect hashing scheme

Full text

Pdf (249 KB)

Source

Communications of the ACM archive
Volume 27 , Issue 4 (April 1984) table of contents

Pages: 384 - 387

Year of Publication: 1984

ISSN:0001-0782

Author

C. C. Chang

National Chung Hsing Univ., Taiwan, Republic of China

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 10, Downloads (12 Months): 43, Citation Count: 14

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/358027.358051 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Buchholz, W. File organization and addressing. IBM Syst. J. 2, (June 1963), 86-111.
	2	Richard J. Cichelli, Minimal perfect hash functions made simple, Communications of the ACM, v.23 n.1, p.17-19, Jan. 1980 [doi>10.1145/358808.358813]
	3	Curtis R. Cook , R. R. Oldehoeft, A letter oriented minimal perfect hashing function, ACM SIGPLAN Notices, v.17 n.9, p.18-27, September 1982 [doi>10.1145/947955.947957]
	4	Du, M.W., Jea, K.F., and Shieh, D.W. The study of a new perfect hash schemes. Proceedings, COMPSAC'80, Chicago, IL, October 1980, 341-347.
	5	Sakti P. Ghosh, Data base organization for data management (2nd ed.), Academic Press Professional, Inc., San Diego, CA, 1986
	6	Hua, L.G. An Introduction to Number Theory, Sheng-Deng Reading, Taiwan (in Chinese), 1975.
	7	G. Jaeschke, Reciprocal hashing: a method for generating minimal perfect hashing functions, Communications of the ACM, v.24 n.12, p.829-833, Dec. 1981 [doi>10.1145/358800.358806]
	8	L. R. Johnson, An indirect chaining method for addressing on secondary keys, Communications of the ACM, v.4 n.5, p.218-222, May 1961 [doi>10.1145/366532.366540]
	9	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	10	Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
	11	Long, C.T. Elementary Introduction to Number Theory, Heath. Boston, 1967.
	12	V. Y. Lum , P. S. T. Yuen , M. Dodd, Key-to-address transform techniques: a fundamental performance study on large existing formatted files, Communications of the ACM, v.14 n.4, p.228-239, April 1971 [doi>10.1145/362575.362578]
	13	W. D. Maurer , T. G. Lewis, Hash Table Methods, ACM Computing Surveys (CSUR), v.7 n.1, p.5-19, March 1975 [doi>10.1145/356643.356645]
	14	Robert Morris, Scatter storage techniques, Communications of the ACM, v.11 n.1, p.38-44, Jan. 1968 [doi>10.1145/362851.362882]
	15	Charles A. Olson, Random access file organization for indirectly addressed records, Proceedings of the 1969 24th national conference, p.539-549, August 26-28, 1969 [doi>10.1145/800195.805959]
	16	Peterson, W.W. Addressing for random-access storage. IBM J. Res. Dev. 1, 2, (April 1957), 130-146.
	17	G. Schay, Jr. , W. G. Spruth, Analysis of a file addressing method, Communications of the ACM, v.5 n.8, p.459-462, Aug. 1962 [doi>10.1145/368637.368827]
	18	Dennis G. Severance, Identifier Search Mechanisms: A Survey and Generalized Model, ACM Computing Surveys (CSUR), v.6 n.3, p.175-194, Sept. 1974 [doi>10.1145/356631.356633]
	19	Sierpinski, W. A Selection of Problems in the Theory of Numbers. Pergamon, London, 1964.
	20	Renzo Sprugnoli, Perfect hashing functions: a single probe retrieving method for static sets, Communications of the ACM, v.20 n.11, p.841-850, Nov. 1977 [doi>10.1145/359863.359887]
	21	M. Tainiter, Addressing for Random-Access Storage with Multiple Bucket Capacities, Journal of the ACM (JACM), v.10 n.3, p.307-315, July 1963 [doi>10.1145/321172.321178]

CITED BY 14

	CORPORATE Tech Correspondence, Technical Correspondence, Communications of the ACM, v.28 n.10, p.1086-1087, Oct. 1985
	CORPORATE Tech Correspondence, Technical correspondence, Communications of the ACM, v.29 n.10, p.1001-1005, Oct. 1986
	Per-Ake Larson , M. V. Ramakrishna, External perfect hashing, ACM SIGMOD Record, v.14 n.4, p.190-200, May 1985
	Rajiv Gupta , Scott A. Smolka , Shaji Bhaskar, On randomization in sequential and distributed algorithms, ACM Computing Surveys (CSUR), v.26 n.1, p.7-86, March 1994
	Christos Faloutsos , Stavros Christodoulakis, Optimal signature extraction and information loss, ACM Transactions on Database Systems (TODS), v.12 n.3, p.395-428, Sept. 1987
	Edward A. Fox , Lenwood S. Heath , Qi Fan Chen , Amjad M. Daoud, Practical minimal perfect hash functions for large databases, Communications of the ACM, v.35 n.1, p.105-121, Jan. 1992
	M. D. Brain , A. L. Tharp, Using Tries to Eliminate Pattern Collisions in Perfect Hashing, IEEE Transactions on Knowledge and Data Engineering, v.6 n.2, p.239-247, April 1994
	Ted G. Lewis , Curtis R. Cook, Hashing for Dynamic and Static Internal Tables, Computer, v.21 n.10, p.45-56, October 1988
	Jun-ichi Aoe, A compendium of key search references, ACM SIGIR Forum, v.24 n.3, p.26-42, Fall 1990
	Wei-Pang Yang , M. W. Du, A Dynamic Perfect Hash Function Defined by an Extended Hash Indicator Table, Proceedings of the 10th International Conference on Very Large Data Bases, p.245-254, August 27-31, 1984
	John A. Trono, An undergraduate project to compute minimal perfect hashing functions, ACM SIGCSE Bulletin, v.24 n.3, p.53-56, Sept. 1992
	Amjad M. Daoud, Perfect hash functions for large dictionaries, Proceedings of the ACM first workshop on CyberInfrastructure: information management in eScience, November 09-09, 2007, Lisbon, Portugal
	Ya-Fen Chang , Chin-Chen Chang, Schemes for Digital Gift Certificates with Low Computation Complexity, Informatica, v.16 n.4, p.503-518, December 2005
	PaiTzu Chang, An efficient hash-based searching for specimens in the museum's exhibit, Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication, January 15-16, 2009, Suwon, Korea