External perfect hashing

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

External perfect hashing

Full text

Pdf (926 KB)

Source

International Conference on Management of Data archive
Proceedings of the 1985 ACM SIGMOD international conference on Management of data table of contents

Austin, Texas, United States

Pages: 190 - 200

Year of Publication: 1985

ISBN:0-89791-160-1

Also published in ...

Authors

Per-Ake Larson	Data Structuring Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada
M. V. Ramakrishna	Data Structuring Group, Department of Computer Science, University of Waterloo, Waterloo, Ontario, Canada

Sponsor

SIGMOD: ACM Special Interest Group on Management of Data

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 8, Downloads (12 Months): 26, Citation Count: 5

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/318898.318916 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.

	CCHL	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]
	CHNG	C. C. Chang, The study of an ordered minimal perfect hashing scheme, Communications of the ACM, v.27 n.4, p.384-387, April 1984 [doi>10.1145/358027.358051]
	CRCN	Cercone, N , Krause, M and Boates, J Mmlmal and almost mmlmal perfect hash function search with appllcatron to natural language lexicon design Comp k Maths with Appl 9, 1(1983), 215-231
	CRMC	Cormack, G V , Horspool, RN S and Kalserswerth, M Practtcal perfect hashing The Computer Journal, 28, l( 1985)
	CRTR	J. Lawrence Carter , Mark N. Wegman, Universal classes of hash functions (Extended Abstract), Proceedings of the ninth annual ACM symposium on Theory of computing, p.106-112, May 04-04, 1977, Boulder, Colorado, United States [doi>10.1145/800105.803400]
	DVS	Davs, F N and Barton, D E Combmatorzal Chance London Griffin, 1962
	FRDM	Fredman, M L , Komlos, J and Szemeredl, E Storing a sparse table with O(1) worst case access time Proc of 23rd Symposmm on Foundations of Computer Science, IEEE Computer Society (1982), 165-168
	GNT	Gaston H. Gonnet , Per Åke Larson, External hasing with limited internal storage, Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems, March 29-31, 1982, Los Angeles, California [doi>10.1145/588111.588153]
	JSCH	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]
	LRSN	Per-Åke Larson , Ajay Kajla, File organization: implementation of a method guaranteeing retrieval in one access, Communications of the ACM, v.27 n.7, p.670-677, July 1984 [doi>10.1145/358105.358193]
	SPRG	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]

CITED BY 5

	M. V. Ramakrishna , P. Mukhopadhyay, Analysis of bounded disorder file organization, Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.117-125, March 1988, Austin, Texas, United States
	M. V. Ramakrishna , P.-:1V Larson, File organization using composite perfect hashing, ACM Transactions on Database Systems (TODS), v.14 n.2, p.231-263, June 1989
	Anastasia Analyti , Sakti Pramanik, Fast search in main memory databases, ACM SIGMOD Record, v.21 n.2, p.215-224, June 1, 1992
	Gaston H. Gonnet , Per-Åke Larson, External hashing with limited internal storage, Journal of the ACM (JACM), v.35 n.1, p.161-184, Jan. 1988
	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