Loading...
Please wait, while we are loading the content...
Similar Documents
Approximate Query Translation across Heterogeneous Information Sources (extended Version) Approximate Query Translation across Heterogeneous Information Sources (extended Version)
| Content Provider | Semantic Scholar |
|---|---|
| Author | Chang, C. |
| Copyright Year | 1999 |
| Abstract | In this paper we present a mechanism for approximately translating Boolean query constraints across heterogeneous information sources. Achieving the best translation is challenging because sources support diierent constraints for formulating queries, and often these constraints cannot be precisely translated. For instance, a query score > 8] might be \perfectly" translated as rating > 0.8] at some site, but can only be approximated as grade = A] at another. Unlike other work, our general framework adopts a customizable \closeness" metric for the translation that combines both precision and recall. Our results show that for query translation we need to handle interdependencies among both query conjuncts as well as disjuncts. As the basis, we identify the essential requirements of a rule system for users to encode the mappings for atomic semantic units. Our algorithm then translates complex queries by rewriting them in terms of the semantic units. We show that, under practical assumptions, our algorithm generates the best approximate translations with respect to the closeness metric of choice. We also present a case study to show how our technique may be applied in practice. Category: Research |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www-db.stanford.edu/pub/papers/atran-tr.ps |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
