Search (2 results, page 1 of 1)

  • × theme_ss:"Volltextretrieval"
  • × theme_ss:"Retrievalalgorithmen"
  1. Ro, J.S.: ¬An evaluation of the applicability of ranking algorithms to improve the effectiveness of full-text retrieval : 1. On the effectiveness of full-text retrieval (1988) 0.01 
    0.007058388 = product of:
  0.01764597 = sum of:
    0.008173384 = weight(_text_:a in 4030) [ClassicSimilarity], result of:
      0.008173384 = score(doc=4030,freq=2.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.15287387 = fieldWeight in 4030, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.09375 = fieldNorm(doc=4030)
    0.009472587 = product of:
      0.018945174 = sum of:
        0.018945174 = weight(_text_:information in 4030) [ClassicSimilarity], result of:
          0.018945174 = score(doc=4030,freq=2.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.23274569 = fieldWeight in 4030, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.09375 = fieldNorm(doc=4030)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    Source
    Journal of the American Society for Information Science. 39(1988), S.73-78
    Type
    a
  2. Couvreur, T.R.; Benzel, R.N.; Miller, S.F.; Zeitler, D.N.; Lee, D.L.; Singhal, M.; Shivaratri, N.; Wong, W.Y.P.: ¬An analysis of performance and cost factors in searching large text databases using parallel search systems (1994) 0.01 
    0.0060245167 = product of:
  0.015061291 = sum of:
    0.009535614 = weight(_text_:a in 7657) [ClassicSimilarity], result of:
      0.009535614 = score(doc=7657,freq=8.0), product of:
        0.053464882 = queryWeight, product of:
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.046368346 = queryNorm
        0.17835285 = fieldWeight in 7657, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.153047 = idf(docFreq=37942, maxDocs=44218)
          0.0546875 = fieldNorm(doc=7657)
    0.005525676 = product of:
      0.011051352 = sum of:
        0.011051352 = weight(_text_:information in 7657) [ClassicSimilarity], result of:
          0.011051352 = score(doc=7657,freq=2.0), product of:
            0.08139861 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.046368346 = queryNorm
            0.13576832 = fieldWeight in 7657, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0546875 = fieldNorm(doc=7657)
      0.5 = coord(1/2)
  0.4 = coord(2/5)
    Abstract
    The results of modelling the performance of searching large text databases (>10 GBytes) via various parallel hardware architectures and search algorithms are discussed. The performance under load and the cost of each configuration are compared. Strengths, weaknesses, performance sensitivities, and search features supported for each configuration are also addressed. In addition, a common search workload used in the modelling is described. The search workload is derived from a set of searches run against the Chemical Abstracts file of bibliographic and abstract text available on STN International. This common workload is applied to all configurations modelled to provide a common basis of comparison
    Source
    Journal of the American Society for Information Science. 45(1994) no.7, S.443-464
    Type
    a

Authors

Years