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
Extensible perfect hashing
Full text PdfPdf (1.35 MB)
Source Conference on Information and Knowledge Management archive
Proceedings of the ninth international conference on Information and knowledge management table of contents
McLean, Virginia, United States
Pages: 446 - 452  
Year of Publication: 2000
ISBN:1-58113-320-0
Authors
Takao Miura  Dept. of Elect. and Elect. Engr., Hosei University, Kajinocho, Koganei, Tokyo, Japan
Wataru Matsumoto  Dept. of Elect. and Elect. Engr., Hosei University, Kajinocho, Koganei, Tokyo, Japan
Isamu Shioya  Dept. of Informatics, SANNO University, Kamikasuya, Isehara, Kanagawa, Japan
Yukio Wada  HITACHI Software Engineering Co. Ltd., Yokohama, Kanagawa, Japan
Sponsors
SIGMIS: ACM Special Interest Group on Management Information Systems
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 21,   Citation Count: 2
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/354756.354852
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
Ronald Fagin , Jurg Nievergelt , Nicholas Pippenger , H. Raymond Strong, Extendible hashing—a fast access method for dynamic files, ACM Transactions on Database Systems (TODS), v.4 n.3, p.315-344, Sept. 1979  [doi>10.1145/320083.320092]
2
Michael L. Fredman , János Komlós , Endre Szemerédi, Storing a Sparse Table with 0(1) Worst Case Access Time, Journal of the ACM (JACM), v.31 n.3, p.538-544, July 1984  [doi>10.1145/828.1884]
 
3
Thomas R. Harbron, File systems: structures and algorithms, Prentice-Hall, Inc., Upper Saddle River, NJ, 1988
4
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]
 
5
Robert Sedgewick, Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1984
6
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  2
Satoshi Watanabe , Takao Miura, Reordering B-tree files, Proceedings of the 2002 ACM symposium on Applied computing, March 11-14, 2002, Madrid, Spain
Takao MIURA , Isamu SHIOYA, Similarity among melodies for music information retrieval, Proceedings of the twelfth international conference on Information and knowledge management, November 03-08, 2003, New Orleans, LA, USA

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL

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

  H. Information Systems
  H.2 DATABASE MANAGEMENT
      H.2.7 Database Administration
          Subjects: Data dictionary/directory


General Terms:
Design, Experimentation, Management, Measurement, Performance, Theory

Collaborative Colleagues:
Takao Miura: colleagues
Wataru Matsumoto: colleagues
Isamu Shioya: colleagues
Yukio Wada: 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