On the containment problem for queries in conjunctive form with negation
From MaRDI portal
Publication:3402280
DOI10.1007/978-3-642-11486-1_10zbMATH Open1274.68098OpenAlexW1866166441MaRDI QIDQ3402280FDOQ3402280
Authors: Victor Felea 
Publication date: 2 February 2010
Published in: Perspectives of Systems Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11486-1_10
Recommendations
- scientific article; zbMATH DE number 1953142
- scientific article; zbMATH DE number 1951561
- Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons
- Some results on the containment and minimization of (in)equality queries
- Conjunctive-query containment and constraint satisfaction
Cited In (11)
- On conjunctive queries containing inequalities
- Title not available (Why is that?)
- On the complexity of entailment in existential conjunctive first-order logic with atomic negation
- Some results on the containment and minimization of (in)equality queries
- Testing containment of object-oriented conjunctive queries is ∏2p-hard
- Parallel-Correctness and Containment for Conjunctive Queries with Union and Negation
- A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries
- Parallel-correctness and containment for conjunctive queries with union and negation
- Containment of acyclic conjunctive queries with negated atoms or arithmetic comparisons
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: On the containment problem for queries in conjunctive form with negation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3402280)
