Callan, J.: Distributed information retrieval (2000)
0.00
0.0021279112 = product of:
0.0042558224 = sum of:
0.0042558224 = product of:
0.008511645 = sum of:
0.008511645 = weight(_text_:a in 31) [ClassicSimilarity], result of:
0.008511645 = score(doc=31,freq=8.0), product of:
0.04772363 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.041389145 = queryNorm
0.17835285 = fieldWeight in 31, 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=31)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- A multi-database model of distributed information retrieval is presented, in which people are assumed to have access to many searchable text databases. In such an environment, full-text information retrieval consists of discovering database contents, ranking databases by their expected ability to satisfy the query, searching a small number of databases, and merging results returned by different databases. This paper presents algorithms for each task. It also discusses how to reorganize conventional test collections into multi-database testbeds, and evaluation methodologies for multi-database experiments. A broad and diverse group of experimental results is presented to demonstrate that the algorithms are effective, efficient, robust, and scalable
- Type
- a
