A complete axiomatization of full acyclic join dependencies

DOI10.1016/S0020-0190(98)00148-3zbMath1338.68061OpenAlexW2090001954MaRDI QIDQ293431

Francesco Mario Malvestuto

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001483?np=y

zbMATH Keywords

relational databasesaxiomsacyclic join dependencies

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (3)

A Generalization of the Inference Rules for Join Dependencies in Databases ⋮ A universal table model for categorical databases ⋮ A Formal Context for Acyclic Join Dependencies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Formal systems for join dependencies
• Finite approximatization of languages for representation of system properties: Axiomatization of dependencies
• A unique formal system for binary decompositions of database relations, probability distributions, and graphs
• Logical and algorithmic properties of conditional independence and graphical models
• On the Desirability of Acyclic Database Schemes
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Decompositions and functional dependencies in relations
• A Complete Axiomatization of Full Join Dependencies

This page was built for publication: A complete axiomatization of full acyclic join dependencies