Search (26 results, page 2 of 2)

0.0039792852 = product of:
  0.011937855 = sum of:
    0.011937855 = weight(_text_:in in 819) [ClassicSimilarity], result of:
      0.011937855 = score(doc=819,freq=10.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.16802745 = fieldWeight in 819, product of:
          3.1622777 = tf(freq=10.0), with freq of:
            10.0 = termFreq=10.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0390625 = fieldNorm(doc=819)
  0.33333334 = coord(1/3)

Abstract

Purpose - An issue that tends to be ignored in information retrieval is the issue of updating inverted files. This is largely because inverted files were devised to provide fast query service, and much work has been done with the emphasis strongly on queries. This paper aims to study the effect of using parallel methods for the update of inverted files in order to reduce costs, by looking at two types of partitioning for inverted files: document identifier and term identifier. Design/methodology/approach - Raw update service and update with query service are studied with these partitioning schemes using an incremental update strategy. The paper uses standard measures used in parallel computing such as speedup to examine the computing results and also the costs of reorganising indexes while servicing transactions. Findings - Empirical results show that for both transaction processing and index reorganisation the document identifier method is superior. However, there is evidence that the term identifier partitioning method could be useful in a concurrent transaction processing context. Practical implications - There is an increasing need to service updates, which is now becoming a requirement of inverted files (for dynamic collections such as the web), demonstrating that a shift in requirements of inverted file maintenance is needed from the past. Originality/value - The paper is of value to database administrators who manage large-scale and dynamic text collections, and who need to use parallel computing to implement their text retrieval services.

0.0035591805 = product of:
  0.010677542 = sum of:
    0.010677542 = weight(_text_:in in 3875) [ClassicSimilarity], result of:
      0.010677542 = score(doc=3875,freq=2.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.15028831 = fieldWeight in 3875, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.078125 = fieldNorm(doc=3875)
  0.33333334 = coord(1/3)

Theme

Semantisches Umfeld in Indexierung u. Retrieval

0.0035591805 = product of:
  0.010677542 = sum of:
    0.010677542 = weight(_text_:in in 7952) [ClassicSimilarity], result of:
      0.010677542 = score(doc=7952,freq=2.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.15028831 = fieldWeight in 7952, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.078125 = fieldNorm(doc=7952)
  0.33333334 = coord(1/3)

Abstract

Paper presented at the Text Retrieval Conference (TREC), Washington, DC, Nov 1992. Describes the OKAPI experimental text information retrieval system in terms of its design principles: the use of simple, robust and easy to use techniques which use best match searching and avoid Boolean logic

0.0035591805 = product of:
  0.010677542 = sum of:
    0.010677542 = weight(_text_:in in 4532) [ClassicSimilarity], result of:
      0.010677542 = score(doc=4532,freq=8.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.15028831 = fieldWeight in 4532, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0390625 = fieldNorm(doc=4532)
  0.33333334 = coord(1/3)

Abstract

This technical note describes straightforward techniques for document indexing and retrieval that have been solidly established through extensive testing and are easy to apply. They are useful for many different types of text material, are viable for very large files, and have the advantage that they do not require special skills or training for searching, but are easy for end users. The document and text retrieval methods described here have a sound theoretical basis, are well established by extensive testing, and the ideas involved are now implemented in some commercial retrieval systems. Testing in the last few years has, in particular, shown that the methods presented here work very well with full texts, not only title and abstracts, and with large files of texts containing three quarters of a million documents. These tests, the TREC Tests (see Harman 1993 - 1997; IP&M 1995), have been rigorous comparative evaluations involving many different approaches to information retrieval. These techniques depend an the use of simple terms for indexing both request and document texts; an term weighting exploiting statistical information about term occurrences; an scoring for request-document matching, using these weights, to obtain a ranked search output; and an relevance feedback to modify request weights or term sets in iterative searching. The normal implementation is via an inverted file organisation using a term list with linked document identifiers, plus counting data, and pointers to the actual texts. The user's request can be a word list, phrases, sentences or extended text.

0.0035234091 = product of:
  0.010570227 = sum of:
    0.010570227 = weight(_text_:in in 5694) [ClassicSimilarity], result of:
      0.010570227 = score(doc=5694,freq=4.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.14877784 = fieldWeight in 5694, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5694)
  0.33333334 = coord(1/3)

Abstract

Reports text information retrieval experiments performed as part of the 3 rd round of Text Retrieval Conferences (TREC) using the Okapi online catalogue system at City University, UK. The emphasis in TREC-3 was: further refinement of term weighting functions; an investigation of run time passage determination and searching; expansion of ad hoc queries by terms extracted from the top documents retrieved by a trial search; new methods for choosing query expansion terms after relevance feedback, now split into methods of ranking terms prior to selection and subsequent selection procedures; and the development of a user interface procedure within the new TREC interactive search framework

Theme

Semantisches Umfeld in Indexierung u. Retrieval

0.0035234091 = product of:
  0.010570227 = sum of:
    0.010570227 = weight(_text_:in in 4706) [ClassicSimilarity], result of:
      0.010570227 = score(doc=4706,freq=4.0), product of:
        0.07104705 = queryWeight, product of:
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.052230705 = queryNorm
        0.14877784 = fieldWeight in 4706, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.3602545 = idf(docFreq=30841, maxDocs=44218)
          0.0546875 = fieldNorm(doc=4706)
  0.33333334 = coord(1/3)

Abstract

Discusses the use of text retrieval methods based on the probabilistic model with Chinese language material. Since Chinese text has no natural word boundaries, either a dictionary based word segmentation method must be applied to the text, or indexing and searching must be done in terms of single Chinese characters. In either case, it becomes important to have a good way of dealing with phrases or contoguous strings of characters; the probabilistic model does not at present have such a facility. Proposes some ad hoc modifications of the probabilistic weighting function and matching method for this purpose