Wei, M.; Xu, L.: Boolean mapping algorithms across heterogeneous information sources (1998)
0.01
0.00888594 = product of:
0.022214849 = sum of:
0.011086997 = weight(_text_:a in 3293) [ClassicSimilarity], result of:
0.011086997 = score(doc=3293,freq=8.0), product of:
0.054392863 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.047173154 = 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.011127852 = product of:
0.022255704 = sum of:
0.022255704 = weight(_text_:information in 3293) [ClassicSimilarity], result of:
0.022255704 = score(doc=3293,freq=6.0), product of:
0.08281143 = queryWeight, product of:
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.047173154 = queryNorm
0.2687516 = fieldWeight in 3293, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.7554779 = idf(docFreq=20772, maxDocs=44218)
0.0625 = fieldNorm(doc=3293)
0.5 = coord(1/2)
0.4 = coord(2/5)
- 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
- Source
- Journal of the China Society for Scientific and Technical Information. 17(1998) no.3, S.185-189
- Type
- a
