Wartik, S.; Fox, E.; Heath, L.; Chen, Q.-F.: Hashing algorithms (1992)
0.00
0.0016295954 = product of:
0.014666359 = sum of:
0.014666359 = weight(_text_:of in 3510) [ClassicSimilarity], result of:
0.014666359 = score(doc=3510,freq=6.0), product of:
0.061262865 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.03917671 = queryNorm
0.23940048 = fieldWeight in 3510, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0625 = fieldNorm(doc=3510)
0.11111111 = coord(1/9)
- 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
