Callan, J.: Distributed information retrieval (2000)
0.02
0.02131408 = product of:
0.06394224 = sum of:
0.06394224 = product of:
0.12788448 = sum of:
0.12788448 = weight(_text_:database in 31) [ClassicSimilarity], result of:
0.12788448 = score(doc=31,freq=8.0), product of:
0.20452234 = queryWeight, product of:
4.042444 = idf(docFreq=2109, maxDocs=44218)
0.050593734 = queryNorm
0.62528366 = fieldWeight in 31, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
4.042444 = idf(docFreq=2109, maxDocs=44218)
0.0546875 = fieldNorm(doc=31)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- 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
