On minimum matrix representation of closure operations
Discrete Applied Mathematics
Perfect error-correcting databases
Discrete Applied Mathematics
Two conjectures of Demetrovics, Furedi, and Katona, concerning partitions
Discrete Mathematics
The characterization of branching dependencies
Discrete Applied Mathematics - Special issue on combinatorial problems in databases
Generalized dependencies in relational databases
Acta Cybernetica
A relational model of data for large shared data banks
Communications of the ACM
On Orthogonal Double Covers of Graphs
Designs, Codes and Cryptography
Extremal Combinatorial Problems in Relational Data Base
FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
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
Hi-index | 0.00 |
The present paper is intended to survey the interaction between relational database theory and coding theory. In particular it is shown how an extremal problem for relational databases gives rise to a new type of coding problem. The former concerns minimal representation of branching dependencies that can be considered as a data mining type question. The extremal configurations involve d-distance sets in the space of disjoint pairs of k-element subsets of an n-element set X. Let X be an n-element finite set, 0 k n/2 an integer. Suppose that {A1, B1} and {A2, B2} are pairs of disjoint k-element subsets of X (that is, |A1| = |B1| = |A2| = |B2| = k, A1 ∩ B1 = 0, A2 ∩ B2 = 0). Define the distance of these pairs by d({A1, B1}, {A2, B2}) = min{|A1 - A2| + |B1 - B2|, |A1 - B2| + |B1 - A2|}.