Query containment for conjunctive queries with regular expressions
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query containment for data integration systems
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Containment of Conjunctive Queries with Safe Negation
ICDT '03 Proceedings of the 9th International Conference on Database Theory
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
On the containment of conjunctive queries
Computer Science in Perspective
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Containment of aggregate queries
ACM SIGMOD Record
Checking query containment with the CQC method
Data & Knowledge Engineering
XML Queries and constraints, containment and reformulation
Theoretical Computer Science - Database theory
The worst-case time complexity for generating all maximal cliques and computational experiments
Theoretical Computer Science - Computing and combinatorics
Rewriting queries using views with negation
AI Communications
A Strong Containment Problem for Queries in Conjunctive Form with Negation
DBKDA '09 Proceedings of the 2009 First International Conference on Advances in Databases, Knowledge, and Data Applications
Some algorithmic improvements for the containment problem of conjunctive queries with negation
ICDT'07 Proceedings of the 11th international conference on Database Theory
| Hi-index | 0.00 |
We consider the problem of query containment for conjunctive queries with the safe negation property. Some necessary conditions for this problem are given. A part of the necessary conditions use maximal cliques from the graphs associated to the first query. These necessary conditions improve the algorithms for the containment problem. For a class of queries a necessary and sufficient condition for containment problem is specified. Some aspects of time complexity for the conditions are discussed.