Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering recursive queries using views
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Querying Heterogeneous Information Sources Using Source Descriptions
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
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
MiniCount: Efficient Rewriting of COUNT-Queries Using Views
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Graph-based Knowledge Representation: Computational Foundations of Conceptual Graphs
Graph-based Knowledge Representation: Computational Foundations of Conceptual Graphs
Compilation of query-rewriting problems into tractable fragments of propositional logic
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Enabling ontology evolution in data integration
Proceedings of the 2010 EDBT/ICDT Workshops
Composing local-as-view mappings: closure and applications
Proceedings of the 13th International Conference on Database Theory
Foundations of schema mapping management
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Composition and inversion of schema mappings
ACM SIGMOD Record
Foundations of uncertain-data integration
Proceedings of the VLDB Endowment
Towards scalable data integration under constraints
Proceedings of the 2012 Joint EDBT/ICDT Workshops
Optimizing query rewriting for multiple queries
Proceedings of the Ninth International Workshop on Information Integration on the Web
Optimizing query rewriting in ontology-based data access
Proceedings of the 16th International Conference on Extending Database Technology
Scalable containment for unions of conjunctive queries under constraints
Proceedings of the Fifth Workshop on Semantic Web Information Management
Mastro studio: managing ontology-based data access applications
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest form, conjunctive queries and views, which already is NP-complete. Our context is data integration, so we search for maximally-contained rewritings. By looking at the problem from a graph perspective we are able to gain a better insight and develop an algorithm which compactly represents common patterns in the source descriptions, and (optionally) pushes some computation offline. This together with other optimizations result in an experimental performance about two orders of magnitude faster than current state-of-the-art algorithms, rewriting queries using over 10000 views within seconds.