Optimizing query rewriting for multiple queries

Authors:
George Konstantinidis;José Luis Ambite
Affiliations:
University of Southern California, Marina Del Rey, CA;University of Southern California, Marina Del Rey, CA
Venue:
Proceedings of the Ninth International Workshop on Information Integration on the Web
Year:
2012

Citing 10
Cited 1

Multiple-query optimization

ACM Transactions on Database Systems (TODS)
Data integration: a theoretical perspective

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
MiniCon: A scalable algorithm for answering queries using views

The VLDB Journal — The International Journal on Very Large Data Bases
Answering queries using views: A survey

The VLDB Journal — The International Journal on Very Large Data Bases
Optimal implementation of conjunctive queries in relational data bases

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

Journal of Automated Reasoning
Compilation of query-rewriting problems into tractable fragments of propositional logic

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Linking data to ontologies

Journal on data semantics X
Scalable query rewriting: a graph-based approach

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data

Scalable containment for unions of conjunctive queries under constraints

Proceedings of the Fifth Workshop on Semantic Web Information Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an scalable algorithm for answering multiple conjunctive queries using views. This is an important problem in query optimization, data integration and ontology-based data access. Since rewriting one conjunctive query using views is an NP-hard problem, we develop an approach where answering n queries takes less than n times the cost of answering one query, by compactly representing and indexing common patterns in the input queries and the views. Our initial experimental results show a promising speed up.