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
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deciding containment for queries with complex objects (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query containment for conjunctive queries with regular expressions
PODS '98 Proceedings of the seventeenth 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
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
IEEE Transactions on Knowledge and Data Engineering
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
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
Checking query containment with the CQC method
Data & Knowledge Engineering
Rewriting queries using views with negation
AI Communications
On querying simple conceptual graphs with negation
Data & Knowledge Engineering
A unified apriori-like algorithm for conjunctive query containment
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Simulation Subsumption or Déjà vu on the Web
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
On Containment of Conjunctive Queries with Negation
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
Type inference for datalog with complex type hierarchies
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Four lessons in versatility or how query languages adapt to the web
Semantic techniques for the web
Deduction in existential conjunctive first-order logic: an algorithm and experiments
AIMSA'10 Proceedings of the 14th international conference on Artificial intelligence: methodology, systems, and applications
Containment of conjunctive queries with negation: algorithms and experiments
DEXA'10 Proceedings of the 21st international conference on Database and expert systems applications: Part II
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part I
Some algorithmic improvements for the containment problem of conjunctive queries with negation
ICDT'07 Proceedings of the 11th international conference on Database Theory
Consistent query answers in virtual data integration systems
Inconsistency Tolerance
On the containment problem for queries in conjunctive form with negation
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
On the complexity of entailment in existential conjunctive first-order logic with atomic negation
Information and Computation
On the decidability and complexity of identity knowledge representation
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Query containment in entity SQL
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
| Hi-index | 0.00 |
We consider the problem of query containment for conjunctive queries with safe negated subgoals (CQ卢s). We propose a new method for the containment test of CQ卢s. Comparing to the previous known approach, which always requires an exponential number of canonical databases to be verified to prove that Q1 驴 Q2, the algorithm proposed in this paper exploits the containment mappings of their positive counterparts, and terminates once the specified test succeeds. We show that in the worst case, the algorithm has the same performance as the one proposed in previous work. We also extend our algorithm to unions of CQ卢s in a natural way. Due to the close relation between query containment and answering queries using views, we give some notes on considering answering queries using views when both queries and views have safe negated subgoals.