Search (1 results, page 1 of 1)

  • × author_ss:"Chen, Q.-F."
  • × theme_ss:"Retrievalalgorithmen"
  1. Wartik, S.; Fox, E.; Heath, L.; Chen, Q.-F.: Hashing algorithms (1992) 0.10
    0.10213885 = product of:
      0.1702314 = sum of:
        0.09146197 = weight(_text_:o in 3510) [ClassicSimilarity], result of:
          0.09146197 = score(doc=3510,freq=2.0), product of:
            0.20624171 = queryWeight, product of:
              5.017288 = idf(docFreq=795, maxDocs=44218)
              0.041106213 = queryNorm
            0.4434698 = fieldWeight in 3510, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.017288 = idf(docFreq=795, maxDocs=44218)
              0.0625 = fieldNorm(doc=3510)
        0.038956303 = weight(_text_:u in 3510) [ClassicSimilarity], result of:
          0.038956303 = score(doc=3510,freq=2.0), product of:
            0.13460001 = queryWeight, product of:
              3.2744443 = idf(docFreq=4547, maxDocs=44218)
              0.041106213 = queryNorm
            0.28942272 = fieldWeight in 3510, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.2744443 = idf(docFreq=4547, maxDocs=44218)
              0.0625 = fieldNorm(doc=3510)
        0.039813124 = weight(_text_:r in 3510) [ClassicSimilarity], result of:
          0.039813124 = score(doc=3510,freq=2.0), product of:
            0.13607219 = queryWeight, product of:
              3.3102584 = idf(docFreq=4387, maxDocs=44218)
              0.041106213 = queryNorm
            0.29258826 = fieldWeight in 3510, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.3102584 = idf(docFreq=4387, maxDocs=44218)
              0.0625 = fieldNorm(doc=3510)
      0.6 = coord(3/5)
    
    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