1996
DOI: 10.1109/69.536244
|View full text |Cite
|
Sign up to set email alerts
|

Boolean query mapping across heterogeneous information sources

Abstract: Abstract---Searching over heterogeneous information sources is difficult because of the non-uniform query languages. Our approach is to allow a user to compose Boolean queries in one rich front-end language. For each user query and target source, we transform the user query into a subsuming query that can be supported by the source but that may return extra documents. The results are then processed by a filter query to yield the correct final result. In this paper we introduce the architecture and associated a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2000
2000
2006
2006

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 58 publications
(1 citation statement)
references
References 8 publications
0
1
0
Order By: Relevance
“…One approach that considers approximate translations is 23,24]. The queries considered there are boolean expressions of constraints of the form attr1 op value] or attr1 op attr2] and mapping rules are employed in order to handle di erences in operators, data formats and attribute names.…”
Section: Observer ( 87] 66] 67]) (Ontology Based System Enhanced Wmentioning
confidence: 99%
“…One approach that considers approximate translations is 23,24]. The queries considered there are boolean expressions of constraints of the form attr1 op value] or attr1 op attr2] and mapping rules are employed in order to handle di erences in operators, data formats and attribute names.…”
Section: Observer ( 87] 66] 67]) (Ontology Based System Enhanced Wmentioning
confidence: 99%