Callan, J.: Distributed information retrieval (2000)
0.04
0.03559696 = product of:
0.094925225 = sum of:
0.07158111 = weight(_text_:retrieval in 31) [ClassicSimilarity], result of:
0.07158111 = score(doc=31,freq=12.0), product of:
0.124912694 = queryWeight, product of:
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.041294612 = queryNorm
0.5730491 = fieldWeight in 31, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
3.024915 = idf(docFreq=5836, maxDocs=44218)
0.0546875 = fieldNorm(doc=31)
0.015619429 = weight(_text_:of in 31) [ClassicSimilarity], result of:
0.015619429 = score(doc=31,freq=8.0), product of:
0.06457475 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.041294612 = queryNorm
0.24188137 = fieldWeight in 31, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0546875 = fieldNorm(doc=31)
0.007724685 = product of:
0.01544937 = sum of:
0.01544937 = weight(_text_:on in 31) [ClassicSimilarity], result of:
0.01544937 = score(doc=31,freq=2.0), product of:
0.090823986 = queryWeight, product of:
2.199415 = idf(docFreq=13325, maxDocs=44218)
0.041294612 = queryNorm
0.17010231 = fieldWeight in 31, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.199415 = idf(docFreq=13325, maxDocs=44218)
0.0546875 = fieldNorm(doc=31)
0.5 = coord(1/2)
0.375 = coord(3/8)
- 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
- Series
- The Kluwer international series on information retrieval; 7
- Source
- Advances in information retrieval: Recent research from the Center for Intelligent Information Retrieval. Ed.: W.B. Croft
