ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
The Analysis of Hashing Techniques That Exhibit k-ary Clustering
Full text PdfPdf (778 KB)
Source Journal of the ACM (JACM) archive
Volume 25 ,  Issue 4  (October 1978) table of contents
Pages: 544 - 555  
Year of Publication: 1978
ISSN:0004-5411
Author
Leo J. Guibas  Xerox Palo Alto Research Center, 3333 Coyote Hill Road, Palo Alto, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 32,   Citation Count: 5
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/322092.322096
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
GUIBAS, L J Hashing techmques that exhibtt secondary or tertiary clustering Proc 2nd US-Japan Comptr Conf., Tokyo, Japan, Aug 1975, pp 324--328
2
Leo J. Guibas , Endre Szemeredi, The analysis of double hashing(Extended Abstract), Proceedings of the eighth annual ACM symposium on Theory of computing, p.187-191, May 03-05, 1976, Hershey, Pennsylvania, United States  [doi>10.1145/800113.803647]
 
3
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
 
4
Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
 
5
PATERSON, i Personal communication, 1976
 
6
POHL, I Mmtmean opttmahty m sorting algorithms Proc 16th Annual Symp. Foundations Comptr Sct, Berkeley, Cahf, 1975, pp. 71-74.
7
J. D. Ullman, A Note on the Efficiency of Hashing Functions, Journal of the ACM (JACM), v.19 n.3, p.569-575, July 1972  [doi>10.1145/321707.321722]

CITED BY  5
J. Ian Munro , Pedro Celis, Techniques for collision resolution in hash tables with open addressing, Proceedings of 1986 ACM Fall joint computer conference, p.601-610, November 1986, Dallas, Texas, United States
Béla Bollobás , Andrei Z. Broder , Istvan Simon, The cost distribution of clustering in random probing, Journal of the ACM (JACM), v.37 n.2, p.224-237, April 1990
Gaston H. Gonnet, Expected Length of the Longest Probe Sequence in Hash Code Searching, Journal of the ACM (JACM), v.28 n.2, p.289-304, April 1981
PerÅke Larson, Analysis of Uniform Hashing, Journal of the ACM (JACM), v.30 n.4, p.805-819, Oct. 1983
Jun-ichi Aoe, A compendium of key search references, ACM SIGIR Forum, v.24 n.3, p.26-42, Fall 1990

INDEX TERMS

Primary Classification:
  E. Data
  E.2 DATA STORAGE REPRESENTATIONS
      Subjects: Hash-table representations

Additional Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.3 Information Search and Retrieval
          Subjects: Clustering


General Terms:
Algorithms, Management, Performance, Theory, Verification

Collaborative Colleagues:
Leo J. Guibas: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player