Wartik, S.; Fox, E.; Heath, L.; Chen, Q.-F.: Hashing algorithms (1992)
0.00
0.0018729243 = product of:
0.0037458485 = sum of:
0.0037458485 = product of:
0.007491697 = sum of:
0.007491697 = weight(_text_:a in 3510) [ClassicSimilarity], result of:
0.007491697 = score(doc=3510,freq=4.0), product of:
0.051978435 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0450792 = queryNorm
0.14413087 = fieldWeight in 3510, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0625 = fieldNorm(doc=3510)
0.5 = coord(1/2)
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
- Type
- a