Abstract
When integrating heterogeneous information resources, it is often the case that the source is rather limited in the kinds of queries it can answer. If a query is asked of the entire system, we have a new kind of optimization problem, in which we must try to express the given query in terms of the limited query templates that this source can answer. For the case of conjunctive queries, we show how to decide with a nondeterministic polynomial-time algorithm whether the given query can be answered. We then extend our results to allow arithmetic comparisons in the given query and in the templates.
Original language | English |
---|---|
Pages | 105-112 |
Number of pages | 8 |
State | Published - 1995 |
Externally published | Yes |
Event | Proceedings of the 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - San Jose, CA, USA Duration: 22 May 1995 → 25 May 1995 |
Conference
Conference | Proceedings of the 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems |
---|---|
City | San Jose, CA, USA |
Period | 22/05/95 → 25/05/95 |