Wartik, S.; Fox, E.; Heath, L.; Chen, Q.-F.: Hashing algorithms (1992)
0.01
0.012262408 = product of:
0.024524815 = sum of:
0.024524815 = product of:
0.073574446 = sum of:
0.073574446 = weight(_text_:n in 3510) [ClassicSimilarity], result of:
0.073574446 = score(doc=3510,freq=2.0), product of:
0.19305801 = queryWeight, product of:
4.3116565 = idf(docFreq=1611, maxDocs=44218)
0.044775832 = queryNorm
0.38110018 = fieldWeight in 3510, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.3116565 = idf(docFreq=1611, maxDocs=44218)
0.0625 = fieldNorm(doc=3510)
0.33333334 = coord(1/3)
0.5 = coord(1/2)
- 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
