A survey of some combinatorial results concerning functional dependencies in database relations.

DOI10.1007/BF01556350zbMath1034.68513WikidataQ114693865 ScholiaQ114693865MaRDI QIDQ1353952

Gyula O. H. Katona, Janos Demetrovics

Publication date: 13 May 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (5)

SPT(q, k, n)-Codes ⋮ Codes that attain minimum distance in every possible direction ⋮ On the Existence of Armstrong Instances with Bounded Domains ⋮ Coding Theory Motivated by Relational Databases ⋮ Design type problems motivated by database theory

Cites Work

• A note on minimal matrix representation of closure operations
• The existence of a simple 3-(28,5,30) design
• Minimum matrix representation of closure operations
• The poset of closures as a model of changing databases
• On the number of maximal dependencies in a data base relation of fixed order
• Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions
• The characterization of branching dependencies
• The number of keys in relational and nested relational databases
• Perfect error-correcting databases
• On minimum matrix representation of closure operations
• On the number of databases and closure operations
• Logarithmic order of free distributive lattice
• Normalization and axiomatization for numerical dependencies
• On generalized graphs
• A short proof of Sperner's lemma
• A relational model of data for large shared data banks
• Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A survey of some combinatorial results concerning functional dependencies in database relations.