A Proof Procedure for Data Dependencies
Journal of the ACM (JACM)
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Answering queries using templates with binding patterns (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Generating efficient plans for queries using views
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Answering queries using views with arithmetic comparisons
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An algorithm for answering queries efficiently using views
ADC '01 Proceedings of the 12th Australasian database conference
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Database Systems: The Complete Book
Database Systems: The Complete Book
Introduction to Algorithms
Query Rewriting with Symmetric Constraints
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
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
Query rewriting using views in the presence of inclusion dependencies
WIDM '03 Proceedings of the 5th ACM international workshop on Web information and data management
Data exchange: semantics and query answering
Theoretical Computer Science - Database theory
Query reformulation with constraints
ACM SIGMOD Record
Query evaluation using overlapping views: completeness and efficiency
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Rewriting queries using views in the presence of arithmetic comparisons
Theoretical Computer Science
View-based query processing: On the relationship between rewriting, answering and losslessness
Theoretical Computer Science
Using views to generate efficient evaluation plans for queries
Journal of Computer and System Sciences
Query rewriting and answering under constraints in data integration systems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Determinacy and rewriting of conjunctive queries using views: a progress report
ICDT'07 Proceedings of the 11th international conference on Database Theory
Query answering by rewriting in GLAV data integration systems under constraints
SWDB'04 Proceedings of the Second international conference on Semantic Web and Databases
Rewriting conjunctive queries determined by views
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Scalable data exchange with functional dependencies
Proceedings of the VLDB Endowment
Scalable containment for unions of conjunctive queries under constraints
Proceedings of the Fifth Workshop on Semantic Web Information Management
Hi-index | 0.01 |
In this paper we consider conjunctive queries and views, and we investigate the problem of query answering using views in the presence of dependencies and in particular the problem of finding equivalent and maximally contained rewritings of a query using a set of views in the presence of dependencies. We present an efficient sound and complete algorithm CoreCoverC which finds equivalent rewritings with the minimum number of subgoals in the presence of weakly acyclic local as view tuple generating dependencies (C"L"A"V^w). We also present an efficient algorithm MiniconC that finds maximally contained rewritings (MCRs) with respect to the language of finite unions of conjunctive queries (UCQ) of a UCQ query Q in the presence of C"L"A"V^w. We also prove that an MCR of a UCQ query Q with respect to UCQ computes all the certain answers of Q both in the absence and presence of a set of dependencies C if the chase of Q with C terminates (and, in the case of dependencies, if such an MCR exists).