Interaction-free multivalued dependency sets

DOI10.1016/0304-3975(86)90016-2zbMath0658.68116OpenAlexW2138865807MaRDI QIDQ1111777

Dirk Van Gucht

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)90016-2

zbMATH Keywords

relational databasemultivalued dependencyjoin dependency

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connections in acyclic hypergraphs
• When do non-conflict-free multivalued dependency sets appear?
• On the Desirability of Acyclic Database Schemes
• Degrees of acyclicity for hypergraphs and relational database schemes
• An extension of conflict-free multivalued dependency sets
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• On acyclic database decompositions
• Closures of database hypergraphs
• On the Equivalence of Database Models
• A simplied universal relation assumption and its properties

This page was built for publication: Interaction-free multivalued dependency sets