Answering queries using templates with binding patterns

Anand Rajaraman*, Yehoshua Sagiv, Jeffrey D. Ullman

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

138 Scopus citations

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 languageEnglish
Pages105-112
Number of pages8
StatePublished - 1995
Externally publishedYes
EventProceedings of the 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems - San Jose, CA, USA
Duration: 22 May 199525 May 1995

Conference

ConferenceProceedings of the 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
CitySan Jose, CA, USA
Period22/05/9525/05/95

Fingerprint

Dive into the research topics of 'Answering queries using templates with binding patterns'. Together they form a unique fingerprint.

Cite this