The complexity of embedded axiomatization for a class of closed database views

DOI10.1007/S10472-005-9013-YMaRDI QIDQ2502159zbMATH OpenOpenAlexFDO

Authors Stephen J. Hegner

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

zbMATH Keywords

complexitydatabaseview

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Foundations of Information and Knowledge Systems
• scientific article; zbMATH DE number 219221
• scientific article; zbMATH DE number 1696841
• An order-based theory of updates for closed database views
• Complexity of Views: Tree and Cyclic Schemas

Cites work

• scientific article; zbMATH DE number 43047 (Why is no real title available?)
• scientific article; zbMATH DE number 41085 (Why is no real title available?)
• scientific article; zbMATH DE number 2021556 (Why is no real title available?)
• scientific article; zbMATH DE number 2080033 (Why is no real title available?)
• scientific article; zbMATH DE number 195102 (Why is no real title available?)
• scientific article; zbMATH DE number 219221 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• A Proof Procedure for Data Dependencies
• An order-based theory of updates for closed database views
• Armstrong databases for functional and inclusion dependencies
• Characterization of desirable properties of general database decompositions.
• Combinators for bi-directional tree transformations: a linguistic approach to the view update problem
• Finitely Specifiable Implicational Dependency Families
• Formal Systems for Tuple and Equality Generating Dependencies
• Foundations of Information and Knowledge Systems
• Horn clauses and database dependencies
• On interpretations of relational languages and solutions to the implied constraint problem
• On the family of generalized dependency constraints
• Polynomial-time implication problems for unary inclusion dependencies
• The Implication Problem for Functional and Inclusion Dependencies is Undecidable
• Unique complements and decompositions of database schemata
• Update semantics of relational views
• Updates of Relational Views

Cited in

(6)

• Characterisations of multivalued dependency implication over undetermined universes
• Foundations of Information and Knowledge Systems
• scientific article; zbMATH DE number 219221 (Why is no real title available?)
• Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context
• Invariance properties of the constant-complement view-update strategy
• Characterization of optimal complements of database views defined by projection

This page was built for publication: The complexity of embedded axiomatization for a class of closed database views

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2502159)