Callan, J.: Distributed information retrieval (2000)
0.01
0.014134051 = product of:
0.084804304 = sum of:
0.084804304 = weight(_text_:ranking in 31) [ClassicSimilarity], result of:
0.084804304 = score(doc=31,freq=2.0), product of:
0.20271951 = queryWeight, product of:
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.03747799 = queryNorm
0.4183332 = fieldWeight in 31, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.4090285 = idf(docFreq=537, maxDocs=44218)
0.0546875 = fieldNorm(doc=31)
0.16666667 = coord(1/6)
- 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
