Wei, M.; Xu, L.: Boolean mapping algorithms across heterogeneous information sources (1998)
0.00
0.002437312 = product of:
0.004874624 = sum of:
0.004874624 = product of:
0.009749248 = sum of:
0.009749248 = weight(_text_:a in 3293) [ClassicSimilarity], result of:
0.009749248 = score(doc=3293,freq=8.0), product of:
0.047829863 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.04148128 = queryNorm
0.20383182 = fieldWeight in 3293, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0625 = fieldNorm(doc=3293)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Notes the difficulties of searching over heterogeneous information sources where query languages are not unifrom. Presents a model where Boolean queries are composed in one rich front end language. For each query and target source, the query is transformed into a subsuming query that can be supported by the source but may return extra documents. The results are then processed by a filter query to yield the correct results
- Type
- a