Search (2 results, page 1 of 1)

Did you mean:
rvk_ss%3a%2200 76400 allgemeines %2f buch- und bibliothekswesen%2c informationswissenschaft %2f bibliothekswesen %2f bibliotheksbenutzung %2f auskunft%2c information%22 2
rvk_ss%3a%2200 73400 allgemeines %2f buch- und bibliothekswesen%2c informationswissenschaft %2f bibliothekswesen %2f bibliotheksbenutzung %2f auskunft%2c information%22 2
rvk_ss%3a%2200 76400 allgemeinen %2f buch- und bibliothekswesen%2c informationswissenschaft %2f bibliothekswesen %2f bibliotheksbenutzung %2f auskunft%2c information%22 2
rvk_ss%3a%2200 76400 allgemeines %2f buch- und bibliothekswesen%2c informationswissenschaft %2f bibliothekswesen %2f bibliotheksbenutzung %2f auskunfts%2c information%22 2
rvk_ss%3a%2223 76400 allgemeines %2f buch- und bibliothekswesen%2c informationswissenschaft %2f bibliothekswesen %2f bibliotheksbenutzung %2f auskunft%2c information%22 2

Wartik, S.; Fox, E.; Heath, L.; Chen, Q.-F.: Hashing algorithms (1992) 0.00

4.5571616E-4 = product of:
  0.006835742 = sum of:
    0.006835742 = product of:
      0.013671484 = sum of:
        0.013671484 = weight(_text_:information in 3510) [ClassicSimilarity], result of:
          0.013671484 = score(doc=3510,freq=6.0), product of:
            0.050870337 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.028978055 = 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.5 = coord(1/2)
  0.06666667 = coord(1/15)

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

3.7209064E-4 = product of:
  0.0055813594 = sum of:
    0.0055813594 = product of:
      0.011162719 = sum of:
        0.011162719 = weight(_text_:information in 3509) [ClassicSimilarity], result of:
          0.011162719 = score(doc=3509,freq=4.0), product of:
            0.050870337 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.028978055 = 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.5 = coord(1/2)
  0.06666667 = coord(1/15)

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