Conjunctive query containment with respect to views and constraints
From MaRDI portal
Publication:672739
DOI10.1016/0020-0190(95)00192-1zbMath1022.68508OpenAlexW2050658385MaRDI QIDQ672739
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(95)00192-1
Related Items (3)
Semantic query optimization in the presence of types ⋮ On the finite controllability of conjunctive query answering in databases under open-world assumption ⋮ A technique for proving decidability of containment and equivalence of linear constraint queries
Cites Work
- Equivalence of views by query capacity
- The complexity of querying indefinite data about linearly ordered domains
- Testing containment of conjunctive queries under functional and inclusion dependencies
- On conjunctive queries containing inequalities
- Equivalences Among Relational Expressions with the Union and Difference Operators
- Equivalences among Relational Expressions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Conjunctive query containment with respect to views and constraints