Search (2 results, page 1 of 1)

  • × author_ss:"Wartik, S."
  • × theme_ss:"Retrievalalgorithmen"
  1. Wartik, S.: Boolean operators (1992) 0.03 
    0.02771635 = product of:
  0.073910266 = sum of:
    0.047231287 = weight(_text_:retrieval in 3509) [ClassicSimilarity], result of:
      0.047231287 = score(doc=3509,freq=4.0), product of:
        0.124912694 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.041294612 = 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.017850775 = weight(_text_:of in 3509) [ClassicSimilarity], result of:
      0.017850775 = score(doc=3509,freq=8.0), product of:
        0.06457475 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.041294612 = queryNorm
        0.27643585 = fieldWeight in 3509, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0625 = fieldNorm(doc=3509)
    0.008828212 = product of:
      0.017656423 = sum of:
        0.017656423 = weight(_text_:on in 3509) [ClassicSimilarity], result of:
          0.017656423 = score(doc=3509,freq=2.0), product of:
            0.090823986 = queryWeight, product of:
              2.199415 = idf(docFreq=13325, maxDocs=44218)
              0.041294612 = queryNorm
            0.19440265 = fieldWeight in 3509, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              2.199415 = idf(docFreq=13325, maxDocs=44218)
              0.0625 = fieldNorm(doc=3509)
      0.5 = coord(1/2)
  0.375 = coord(3/8)
    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
  2. Wartik, S.; Fox, E.; Heath, L.; Chen, Q.-F.: Hashing algorithms (1992) 0.02 
    0.018326376 = product of:
  0.0733055 = sum of:
    0.057846278 = weight(_text_:retrieval in 3510) [ClassicSimilarity], result of:
      0.057846278 = score(doc=3510,freq=6.0), product of:
        0.124912694 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.041294612 = 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.0154592255 = weight(_text_:of in 3510) [ClassicSimilarity], result of:
      0.0154592255 = score(doc=3510,freq=6.0), product of:
        0.06457475 = queryWeight, product of:
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.041294612 = queryNorm
        0.23940048 = fieldWeight in 3510, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.5637573 = idf(docFreq=25162, maxDocs=44218)
          0.0625 = fieldNorm(doc=3510)
  0.25 = coord(2/8)
    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

Authors