Performance in Practice of String Hashing Functions.
M. V. Ramakrishna, Justin Zobel:
Performance in Practice of String Hashing Functions.
DASFAA 1997: 215-224@inproceedings{DBLP:conf/dasfaa/RamakrishnaZ97,
author = {M. V. Ramakrishna and
Justin Zobel},
editor = {Rodney W. Topor and
Katsumi Tanaka},
title = {Performance in Practice of String Hashing Functions},
booktitle = {Database Systems for Advanced Applications '97, Proceedings of
the Fifth International Conference on Database Systems for Advanced
Applications (DASFAA), Melbourne, Australia, April 1-4, 1997},
publisher = {World Scientific},
series = {Advanced Database Research and Development Series},
volume = {6},
year = {1997},
isbn = {981-02-3107-5},
pages = {215-224},
ee = {db/conf/dasfaa/RamakrishnaZ97.html},
crossref = {DBLP:conf/dasfaa/97},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
CDROM Version: Load the CDROM "Volume 2 Issue 3, SIGIR, DASFAA'97, OODBS'86" and ...
DVD Version: Load ACM SIGMOD Anthology DVD 1" and ...
BibTeX
References
- [1]
- Gordon V. Cormack, R. Nigel Horspool, M. Kaiserswerth:
Practical Perfect Hashing.
Comput. J. 28(1): 54-58(1985) BibTeX
- [2]
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest:
Introduction to Algorithms.
The MIT Press and McGraw-Hill Book Company 1989, ISBN 0-262-03141-8,0-07-013143-0
BibTeX
- [3]
- R. F. Deutscher, Paul G. Sorenson, J. Paul Tremblay:
Distribution-Dependent Hashing Functions and Their Characteristics.
SIGMOD Conference 1975: 224-236 BibTeX
- [4]
- Edward A. Fox, Qi Fan Chen, Amjad M. Daoud, Lenwood S. Heath:
Order-Preserving Minimal Perfect Hash Functions and Information Retrieval.
ACM Trans. Inf. Syst. 9(3): 281-308(1991) BibTeX
- [5]
- Gaston H. Gonnet:
Expected Length of the Longest Probe Sequence in Hash Code Searching.
J. ACM 28(2): 289-304(1981) BibTeX
- [6]
- Donna Harman:
Overview of the First Text REtrieval Conference (TREC-1).
TREC 1992: 1-20 BibTeX
- [7]
- Gary D. Knott:
Hashing Functions.
Comput. J. 18(3): 265-278(1975) BibTeX
- [8]
- Donald E. Knuth:
The Art of Computer Programming, Volume III: Sorting and Searching.
Addison-Wesley 1973, ISBN 0-201-03803-X
BibTeX
- [9]
- Per-Åke Larson:
Expected Worst-Case Performance of Hash Files.
Comput. J. 25(3): 347-352(1982) BibTeX
- [10]
- Vincent Y. Lum:
General Performance Analysis of Key-to-Address Transformation Methods Using an Abstract File Concept.
Commun. ACM 16(10): 603-612(1973) BibTeX
- [11]
- Vincent Y. Lum, P. S. T. Yuen, M. Dodd:
Key-to-Address Transform Techniques: A Fundamental Performance Study on Large Existing Formatted Files.
Commun. ACM 14(4): 228-239(1971) BibTeX
- [12]
- Bruce J. McKenzie, R. Harries, Timothy C. Bell:
Selecting a Hashing Algorithm.
Softw., Pract. Exper. 20(2): 209-224(1990) BibTeX
- [13]
- Peter K. Pearson:
Fast Hashing of Variable-Length Text Strings.
Commun. ACM 33(6): 677-680(1990) BibTeX
- [14]
- M. V. Ramakrishna:
Hashing in Practive, Analysis of Hashing and Universal Hashing.
SIGMOD Conference 1988: 191-199 BibTeX
- [15]
- M. V. Ramakrishna:
Practical Performance Of Bloom Filters and Parallel Free-Text Searching.
Commun. ACM 32(10): 1237-1239(1989) BibTeX
- [16]
- M. V. Ramakrishna, Per-Åke Larson:
File Organization Using Composite Perfect Hashing.
ACM Trans. Database Syst. 14(2): 231-263(1989) BibTeX
- [17]
- Robert Sedgewick:
Algorithms, 2nd Edition.
Addison-Wesley 1988, ISBN 0-201-06673-4
BibTeX
- [18]
- Justin Zobel, Philip W. Dart:
Phonetic String Matching: Lessons from Information Retrieval.
SIGIR 1996: 166-172 BibTeX
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
DASFAA 1997 Proceedings: Copyright © by World Scientific Publishing Pte Ltd.
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:05:32 2009