Perfect error-correcting databases
Discrete Applied Mathematics
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Extremal Theorems for Databases
Annals of Mathematics and Artificial Intelligence
Minimum matrix representation of closure operations
Discrete Applied Mathematics
Constraint acquisition you can chase but you cannot find
APCCM '08 Proceedings of the fifth Asia-Pacific conference on Conceptual Modelling - Volume 79
Constraint acquisition for Entity-Relationship models
Data & Knowledge Engineering
On Matrix Representations of Participation Constraints
ER '09 Proceedings of the ER 2009 Workshops (CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS) on Advances in Conceptual Modeling - Challenging Perspectives
Design by example for SQL table definitions with functional dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
On the existence of armstrong data trees for XML functional dependencies
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
APCCM '12 Proceedings of the Eighth Asia-Pacific Conference on Conceptual Modelling - Volume 130
| Hi-index | 0.00 |
Some new and improved results on the minimum representation problem for key systems will be presented. By improving a lemma of the second author we obtain better or new results on badly representable key systems, such as showing the most badly representable key system known, namely of size 2n(1−c·loglogn / logn) where n is the number of attributes. We also make an observation on a theorem of J. Demetrovics, Z. Füredi and the first author and give some new well representable key systems as well.