Search (4 results, page 1 of 1)

0.10433822 = product of:
  0.20867644 = sum of:
    0.14619127 = weight(_text_:storage in 5123) [ClassicSimilarity], result of:
      0.14619127 = score(doc=5123,freq=6.0), product of:
        0.23366846 = queryWeight, product of:
          5.4488444 = idf(docFreq=516, maxDocs=44218)
          0.04288404 = queryNorm
        0.62563545 = fieldWeight in 5123, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          5.4488444 = idf(docFreq=516, maxDocs=44218)
          0.046875 = fieldNorm(doc=5123)
    0.04505459 = weight(_text_:retrieval in 5123) [ClassicSimilarity], result of:
      0.04505459 = score(doc=5123,freq=6.0), product of:
        0.12972058 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04288404 = queryNorm
        0.34732026 = fieldWeight in 5123, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.046875 = fieldNorm(doc=5123)
    0.017430587 = product of:
      0.034861173 = sum of:
        0.034861173 = weight(_text_:22 in 5123) [ClassicSimilarity], result of:
          0.034861173 = score(doc=5123,freq=2.0), product of:
            0.1501726 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.04288404 = queryNorm
            0.23214069 = fieldWeight in 5123, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.046875 = fieldNorm(doc=5123)
      0.5 = coord(1/2)
  0.5 = coord(3/6)

Abstract

Traces the development of text searching and retrieval software designed to cope with the increasing demands made by the storage and handling of large amounts of data, recorded on high data storage media, from CD-ROM to multi gigabyte storage media and online information services, with particular reference to the need to cope with graphics as well as conventional ASCII text. Includes details of: Boolean searching, fuzzy searching and matching; relevance ranking; proximity searching and improved strategies for dealing with text searching in very large databases. Concludes that the best searching tools for CD-ROM publishers are those optimized for searching and retrieval on CD-ROM. CD-ROM drives have relatively lower random seek times than hard discs and so the software most appropriate to the medium is that which can effectively arrange the indexes and text on the CD-ROM to avoid continuous random access searching. Lists and reviews a selection of software packages designed to achieve the sort of results required for rapid CD-ROM searching

Date

12. 9.1996 13:56:22

0.091578074 = product of:
  0.18315615 = sum of:
    0.099470556 = weight(_text_:storage in 3495) [ClassicSimilarity], result of:
      0.099470556 = score(doc=3495,freq=4.0), product of:
        0.23366846 = queryWeight, product of:
          5.4488444 = idf(docFreq=516, maxDocs=44218)
          0.04288404 = queryNorm
        0.42569098 = fieldWeight in 3495, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          5.4488444 = idf(docFreq=516, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3495)
    0.06131152 = weight(_text_:retrieval in 3495) [ClassicSimilarity], result of:
      0.06131152 = score(doc=3495,freq=16.0), product of:
        0.12972058 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04288404 = queryNorm
        0.47264296 = fieldWeight in 3495, product of:
          4.0 = tf(freq=16.0), with freq of:
            16.0 = termFreq=16.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3495)
    0.022374075 = weight(_text_:systems in 3495) [ClassicSimilarity], result of:
      0.022374075 = score(doc=3495,freq=2.0), product of:
        0.13179013 = queryWeight, product of:
          3.0731742 = idf(docFreq=5561, maxDocs=44218)
          0.04288404 = queryNorm
        0.1697705 = fieldWeight in 3495, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0731742 = idf(docFreq=5561, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3495)
  0.5 = coord(3/6)

Abstract

The book consists of separate chapters by some 20 different authors. It covers many of the information retrieval algorithms, including methods of file organization, file search and access, and query processing

Content

An edited volume containing data structures and algorithms for information retrieval including a disk with examples written in C. for prgrammers and students interested in parsing text, automated indexing, its the first collection in book form of the basic data structures and algorithms that are critical to the storage and retrieval of documents. ------------------Enthält die Kapitel: FRAKES, W.B.: Introduction to information storage and retrieval systems; BAEZA-YATES, R.S.: Introduction to data structures and algorithms related to information retrieval; HARMAN, D. u.a.: Inverted files; FALOUTSOS, C.: Signature files; GONNET, G.H. u.a.: New indices for text: PAT trees and PAT arrays; FORD, D.A. u. S. CHRISTODOULAKIS: File organizations for optical disks; FOX, C.: Lexical analysis and stoplists; FRAKES, W.B.: Stemming algorithms; SRINIVASAN, P.: Thesaurus construction; BAEZA-YATES, R.A.: String searching algorithms; HARMAN, D.: Relevance feedback and other query modification techniques; WARTIK, S.: Boolean operators; WARTIK, S. u.a.: Hashing algorithms; HARMAN, D.: Ranking algorithms; FOX, E.: u.a.: Extended Boolean models; RASMUSSEN, E.: Clustering algorithms; HOLLAAR, L.: Special-purpose hardware for information retrieval; STANFILL, C.: Parallel information retrieval algorithms

0.08007109 = product of:
  0.16014218 = sum of:
    0.09847082 = weight(_text_:storage in 2417) [ClassicSimilarity], result of:
      0.09847082 = score(doc=2417,freq=2.0), product of:
        0.23366846 = queryWeight, product of:
          5.4488444 = idf(docFreq=516, maxDocs=44218)
          0.04288404 = queryNorm
        0.42141256 = fieldWeight in 2417, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.4488444 = idf(docFreq=516, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2417)
    0.030347655 = weight(_text_:retrieval in 2417) [ClassicSimilarity], result of:
      0.030347655 = score(doc=2417,freq=2.0), product of:
        0.12972058 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04288404 = queryNorm
        0.23394634 = fieldWeight in 2417, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2417)
    0.031323705 = weight(_text_:systems in 2417) [ClassicSimilarity], result of:
      0.031323705 = score(doc=2417,freq=2.0), product of:
        0.13179013 = queryWeight, product of:
          3.0731742 = idf(docFreq=5561, maxDocs=44218)
          0.04288404 = queryNorm
        0.23767869 = fieldWeight in 2417, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.0731742 = idf(docFreq=5561, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2417)
  0.5 = coord(3/6)

Abstract

Proposes the weight partitioned signature file, a signature file organization for supporting document ranking. It uses multiple signature files each corresponding to one term frequency to represent terms with different term frequencies. Words with the same term frequency in a document are grouped together and hased into the signature file corresponding to that term frequency. Investigates the effect of false drops on retrieval effectiveness. Analyses the performance of the weight partitioned signature file under different search strategies and configurations. Obtains an optimal formula for storage allocation to minimise the effect of false drops on document ranks. Analytical results are supported by experiments on document collections

Source

ACM transactions on information systems. 14(1996) no.2, S.109-137

0.057536956 = product of:
  0.17261086 = sum of:
    0.112538084 = weight(_text_:storage in 3510) [ClassicSimilarity], result of:
      0.112538084 = score(doc=3510,freq=2.0), product of:
        0.23366846 = queryWeight, product of:
          5.4488444 = idf(docFreq=516, maxDocs=44218)
          0.04288404 = queryNorm
        0.48161435 = fieldWeight in 3510, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          5.4488444 = idf(docFreq=516, maxDocs=44218)
          0.0625 = fieldNorm(doc=3510)
    0.06007278 = weight(_text_:retrieval in 3510) [ClassicSimilarity], result of:
      0.06007278 = score(doc=3510,freq=6.0), product of:
        0.12972058 = queryWeight, product of:
          3.024915 = idf(docFreq=5836, maxDocs=44218)
          0.04288404 = 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.33333334 = coord(2/6)

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