On conjunctive queries containing inequalities
Journal of the ACM (JACM)
Constraint checking with partial information
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Information integration using logical views
Theoretical Computer Science - Special issue on the 6th International Conference on Database Theory—ICDT '97
Answering queries using views with arithmetic comparisons
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimizing Queries with Materialized Views
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
A Scalable Algorithm for Answering Queries Using Views
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Queries Independent of Updates
VLDB '93 Proceedings of the 19th International Conference 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
Query containment for data integration systems
Journal of Computer and System Sciences - Special issue on PODS 2000
Answering queries with arithmetic expressions in heterogeneous systems
Proceedings of the first international workshop on Interoperability of heterogeneous information systems
Chained forests for fast subsumption matching
Proceedings of the 2007 inaugural international conference on Distributed event-based systems
Dynamic content-based channels: meeting in the middle
Proceedings of the second international conference on Distributed event-based systems
Fast track article: Dynamic filter merging and mergeability detection for publish/subscribe
Pervasive and Mobile Computing
Conjunctive queries with constraints: homomorphism, containment and rewriting
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Hi-index | 0.00 |
We study the problem of query containment for conjunctive queries with arithmetic constraints (QWAE). Such queries arise naturally in conventional database applications, information integration, and cooperative information systems. Given two such queries Q1 and Q2, we propose an algorithm that decides the containment $Q_2\sqsubseteq Q_1$. The proposed algorithm returns a QWAE Q2′ obtained by rewriting Q2′ such that $Q_2'\sqsubseteq Q_2$. This provides partial answers to the QWAE Q1, which would otherwise be discarded by existing standard or extended techniques for query containment.