Split-freedom and MVD-intersection: A new characterization of multivalued dependencies having conflict-free covers
From MaRDI portal
Publication:1823739
DOI10.1016/0304-3975(86)90013-7zbMath0681.68123WikidataQ114683727 ScholiaQ114683727MaRDI QIDQ1823739
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(86)90013-7
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A characterization of multivalued dependencies equivalent to a join dependency
- On equivalence of relational and network database models
- On the Desirability of Acyclic Database Schemes
- Syntactic Characterization of Tree Database Schemas
- On the menbership problem for functional and multivalued dependencies in relational databases
- An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic
- On the Equivalence of Database Models
- An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
- A simplied universal relation assumption and its properties