The complexity of embedded axiomatization for a class of closed database views
From MaRDI portal
Publication:2502159
DOI10.1007/s10472-005-9013-yzbMath1097.68554OpenAlexW2038702026MaRDI QIDQ2502159
Publication date: 12 September 2006
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-005-9013-y
Related Items
Invariance Properties of the Constant-Complement View-Update Strategy, Characterisations of multivalued dependency implication over undetermined universes, Characterization of Optimal Complements of Database Views Defined by Projection, Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Armstrong databases for functional and inclusion dependencies
- Unique complements and decompositions of database schemata
- Characterization of desirable properties of general database decompositions.
- An order-based theory of updates for closed database views
- Formal Systems for Tuple and Equality Generating Dependencies
- Polynomial-time implication problems for unary inclusion dependencies
- The Implication Problem for Functional and Inclusion Dependencies is Undecidable
- Finitely Specifiable Implicational Dependency Families
- Updates of Relational Views
- A Proof Procedure for Data Dependencies
- Update semantics of relational views
- On interpretations of relational languages and solutions to the implied constraint problem
- Horn clauses and database dependencies
- On the family of generalized dependency constraints
- Combinators for bi-directional tree transformations
- Foundations of Information and Knowledge Systems
