Search (3 results, page 1 of 1)

  • × author_ss:"Bell, T.C."
  1. Wittan, I.H.; Bell, T.C.; Nevill, C.G.: Indexing and compressing full-text databases for CD-ROM (1991) 0.00 
    0.0029000505 = product of:
  0.005800101 = sum of:
    0.005800101 = product of:
      0.011600202 = sum of:
        0.011600202 = weight(_text_:a in 4828) [ClassicSimilarity], result of:
          0.011600202 = score(doc=4828,freq=12.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.21843673 = fieldWeight in 4828, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4828)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    CD-ROM is an attractive delivery vehicle for full text databases. Large storage capacity and low access speed, carefully designed indexing structures, including a concordance, are necessary to enable the text to be retrieved efficiently. However, the indexes are sufficiently large that they tax the ability of the main store to hold them when processing queries. The use of compression techniques can substantially increase the volume of text that a disc can accomodate, and substantially decrease the amount of primary storage needed to hold the indexes. Describes a suitable indexing mechanism, and its compression potential using modern compression methods. It is possible to double the amount of text that can be stored on a CD-ROM disc and include a full concordance and indexes as well
    Type
    a
  2. Witten, I.H.; Moffat, A.; Bell, T.C.: Managing gigabytes : compressing and indexing documents and images (1994) 0.00 
    0.0023919214 = product of:
  0.0047838427 = sum of:
    0.0047838427 = product of:
      0.009567685 = sum of:
        0.009567685 = weight(_text_:a in 3083) [ClassicSimilarity], result of:
          0.009567685 = score(doc=3083,freq=4.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.18016359 = fieldWeight in 3083, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.078125 = fieldNorm(doc=3083)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Offers both students and professionals guidance on large-scale information systems. This resource describes a new generation of techniques for compressing, storing, and retrieving information - both machine readable text and optically scanned documents. Appropriate for information science and information retrieval courses
  3. Bell, T.C.; Moffat, A.; Nevill-Manning, C.G.; Witten, I.H.; Zobel, J.: Data compression in full-text retrieval system (1993) 0.00 
    0.0020506454 = product of:
  0.004101291 = sum of:
    0.004101291 = product of:
      0.008202582 = sum of:
        0.008202582 = weight(_text_:a in 5643) [ClassicSimilarity], result of:
          0.008202582 = score(doc=5643,freq=6.0), product of:
            0.053105544 = queryWeight, product of:
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.046056706 = queryNorm
            0.1544581 = fieldWeight in 5643, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.153047 = idf(docFreq=37942, maxDocs=44218)
              0.0546875 = fieldNorm(doc=5643)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    When data compression is applied to full-text retrieval systems, intricate relationships emerge between the amount of compression, access speed, and computing resources required. We propose compression methods, and explore corresponding tradeoffs, for all components of static full-text systems such as text databases on CD-ROM. These components include lexical indexes, and the mein text itself. Results are reported on the application of the methods to several substantial full-text databases, and show that a large, unindexed text can be stored, along with indexes that facilitate fast searching, in less than half its original size - at some appreciable cost in primary memory requirements
    Type
    a

Authors

Types