On the containment problem for queries in conjunctive form with negation

Authors:
Victor Felea
Affiliations:
Computer Science Department, “Al.I.Cuza” University of Iasi, Iasi, Romania
Venue:
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
Year:
2009

Citing 15
Cited 0

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
Web Service Composition Through Declarative Queries: The Case of Conjunctive Queries with Union and Negation

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of query containment for conjunctive queries with safe negation property. A necessary and sufficient condition for two queries to be in containment relation is given. Using this condition a class of queries is emphasized and a characterization of containment problem for this class using certain maximal sets is specified. The time complexity of containment problem for this class of queries is studied.