Wartik, S.; Fox, E.; Heath, L.; Chen, Q.-F.: Hashing algorithms (1992)
0.06
0.057536956 = product of:
0.17261086 = sum of:
0.112538084 = weight(_text_:storage in 3510) [ClassicSimilarity], result of:
0.112538084 = score(doc=3510,freq=2.0), product of:
0.23366846 = queryWeight, product of:
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.04288404 = queryNorm
0.48161435 = fieldWeight in 3510, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4488444 = idf(docFreq=516, maxDocs=44218)
0.0625 = fieldNorm(doc=3510)
0.06007278 = weight(_text_:retrieval in 3510) [ClassicSimilarity], result of:
0.06007278 = score(doc=3510,freq=6.0), product of:
0.12972058 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.04288404 = queryNorm
0.46309367 = fieldWeight in 3510, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0625 = fieldNorm(doc=3510)
0.33333334 = coord(2/6)
- Abstract
- Discusses hashing, an information storage and retrieval technique useful for implementing many of the other structures in this book. The concepts underlying hashing are presented, along with 2 implementation strategies. The chapter also contains an extensive discussion of perfect hashing, an important optimization in information retrieval, and an O(n) algorithm to find minimal perfect hash functions for a set of keys
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
