Wartik, S.; Fox, E.; Heath, L.; Chen, Q.-F.: Hashing algorithms (1992)
0.01
0.007927371 = product of:
0.055491596 = sum of:
0.013980643 = weight(_text_:information in 3510) [ClassicSimilarity], result of:
0.013980643 = score(doc=3510,freq=6.0), product of:
0.052020688 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.029633347 = queryNorm
0.2687516 = fieldWeight in 3510, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0625 = fieldNorm(doc=3510)
0.041510954 = weight(_text_:retrieval in 3510) [ClassicSimilarity], result of:
0.041510954 = score(doc=3510,freq=6.0), product of:
0.08963835 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.029633347 = 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.14285715 = coord(2/14)
- 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
