Search (2 results, page 1 of 1)

Did you mean:
rswk_00%3a%20information retrieval %2f lehrbuch%22 2
rswk_00%3a%20information retrieval %2f lehrbuchs%22 2
rswk_00%3a%20information retrieval %2f lehrbuches%22 2
rswk_00%3a%20information retrieval %2f lehrfach%22 2
rswk_00%3a%20information retrieval %2f lesebuch%22 2

Wartik, S.; Fox, E.; Heath, L.; Chen, Q.-F.: Hashing algorithms (1992) 0.02
```
0.015872994 = product of:
  0.06349198 = sum of:
    0.06349198 = weight(_text_:retrieval in 3510) [ClassicSimilarity], result of:
      0.06349198 = score(doc=3510,freq=6.0), product of:
        0.13710396 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.045324896 = 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.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.01

0.012960245 = product of:
  0.05184098 = sum of:
    0.05184098 = weight(_text_:retrieval in 3509) [ClassicSimilarity], result of:
      0.05184098 = score(doc=3509,freq=4.0), product of:
        0.13710396 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.045324896 = queryNorm
        0.37811437 = fieldWeight in 3509, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.024915 = idf(docFreq=5836, 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

Search (2 results, page 1 of 1)

Authors