Search (2 results, page 1 of 1)
- Did you mean:
- editor_ss:"schwerpunktinitiative "digitale information" der alliant der deutschen wissenschaftsorganisationen" 2
- editor_ss:"schwerpunktinitiative "digitale information" der allianz der deutschen wissenschaftsorganisation" 2
- editor_ss:"schwerpunktinitiativen "digitale information" der allianz der deutschen wissenschaftsorganisationen" 2
- editor_ss:"schwerpunktinitiative "digitale information" der alliance der deutschen wissenschaftsorganisationen" 2
- editor_ss:"schwerpunktinitiativen "digitale information" der alliant der deutschen wissenschaftsorganisationen" 2
-
Wartik, S.; Fox, E.; Heath, L.; Chen, Q.-F.: Hashing algorithms (1992)
0.00
0.004121639 = product of: 0.016486555 = sum of: 0.016486555 = weight(_text_:information in 3510) [ClassicSimilarity], result of: 0.016486555 = score(doc=3510,freq=6.0), product of: 0.06134496 = queryWeight, product of: 1.7554779 = idf(docFreq=20772, maxDocs=44218) 0.034944877 = 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.25 = coord(1/4)
- 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
-
Wartik, S.: Boolean operators (1992)
0.00
0.0033653039 = product of: 0.013461215 = sum of: 0.013461215 = weight(_text_:information in 3509) [ClassicSimilarity], result of: 0.013461215 = score(doc=3509,freq=4.0), product of: 0.06134496 = queryWeight, product of: 1.7554779 = idf(docFreq=20772, maxDocs=44218) 0.034944877 = queryNorm 0.21943474 = fieldWeight in 3509, product of: 2.0 = tf(freq=4.0), with freq of: 4.0 = termFreq=4.0 1.7554779 = idf(docFreq=20772, maxDocs=44218) 0.0625 = fieldNorm(doc=3509) 0.25 = coord(1/4)
- Abstract
- Presents an overview of Boolean operations, which are one means of expressing queries in information retrieval systems. The concepts of Boolean operations are introduced, and 2 implementations based on sets are given. One implementation uses bit vectors; the other, hashing. The relative performance characteristics of the approaches are shown
- Source
- Information retrieval: data structures and algorithms. Ed.: W.B. Frakes u. R. Baeza-Yates
Authors
- Chen, Q.-F. 1
- Fox, E. 1
- Heath, L. 1