Normalization and axiomatization for numerical dependencies
Information and Control
Chordality properties on graphs and minimal conceptual connections in semantic data models
Journal of Computer and System Sciences
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
The number of keys in relational and nested relational databases
Discrete Applied Mathematics - Special issue on combinatorial problems in databases
On Orthogonal Double Covers of Graphs
Designs, Codes and Cryptography
Generalized dependencies in relational databases
Acta Cybernetica
Horn clauses and database dependencies
Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Degrees of acyclicity for hypergraphs and relational database schemes
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
On the recognition and design of acyclic databases
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
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 equidistant constant weight codes
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Counter-free keys and functional dependencies in higher-order datamodels
Fundamenta Informaticae
Keys and Armstrong databases in trees with restructuring
Acta Cybernetica
Orthogonal covers by multiplication graphs
Discrete Applied Mathematics
Minimum matrix representation of closure operations
Discrete Applied Mathematics
On the existence of armstrong instances with bounded domains
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Upper bounds for constant-weight codes
IEEE Transactions on Information Theory
Note on the size of binary Armstrong codes
Designs, Codes and Cryptography
| Hi-index | 0.00 |
In the present paper results on minimal Armstrong instances of certain integrity constraints in relational databases are surveyed that lead to coding theory type problems. First, branching dependencies are studied. Finding minimal Armstrong instances for some collections of these integrity constraints lead to a new metric space. Error correcting codes in that space have been investigated on their own right since then. In the second part Armstrong instances of functional dependencies are investigated when the size of the domain of each attribute is bounded by a constant q. These come up naturally in real life databases, as well as in the study of higher order data model. These instances can be directly considered as q-ary codes, if tuples are taken as codewords.