On the finite and general implication problems of independence atoms and keys
From MaRDI portal
Publication:269507
DOI10.1016/j.jcss.2016.02.007zbMath1338.68057OpenAlexW2294301821MaRDI QIDQ269507
Juha Kontinen, Sebastian Link, Miika Hannula
Publication date: 18 April 2016
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2016.02.007
independenceaxiomatizationrelational databasesArmstrong relationdependence logicfinite implicationgeneral implicationkey
Related Items
Controlling entity integrity with key sets, Characterising modal definability of team-based logics via the universal modality, Approximation and dependence via multiteam semantics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Characterisations of multivalued dependency implication over undetermined universes
- Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions
- Corrigendum to ``On the undecidability of implications between embedded multivalued database dependencies
- Dependency-preserving normalization of relational and XML data
- Logical and algorithmic properties of stable conditional independence
- Charting the completeness frontier of inference systems for multivalued dependencies
- Testing containment of conjunctive queries under functional and inclusion dependencies
- Inclusion dependencies and their interaction with functional dependencies
- Inferences for numerical dependencies
- Finite approximatization of languages for representation of system properties: Axiomatization of dependencies
- The interaction of integrity constraints in an information system
- Axioms and algorithms for inferences involving probabilistic independence
- On the number of candidate keys
- Candidate keys for relations
- Semantic foundations of 4NF in relational database design
- Logical and algorithmic properties of conditional independence and graphical models
- Asymptotic properties of keys and functional dependencies in random databases
- How to prevent interaction of functional and inclusion dependencies
- Dependence and independence
- On the completeness of the semigraphoid axioms for deriving arbitrary from saturated conditional independence statements
- On the conditional independence implication problem: a lattice-theoretic approach
- On the undecidability of implications between embedded multivalued database dependencies
- Independence in Database Relations
- Logical Foundations of Possibilistic Keys
- The implication problem for functional and inclusion dependencies
- On XML integrity constraints in the presence of DTDs
- Polynomial-time implication problems for unary inclusion dependencies
- The Implication Problem for Functional and Inclusion Dependencies is Undecidable
- A normal form for relational databases that is based on domains and keys
- An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
- Horn clauses and database dependencies
- Solving the Implication Problem for XML Functional Dependencies with Properties
- A Finite Axiomatization of Conditional Independence and Inclusion Dependencies
- Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies
