A relational model of data for large shared data banks
Communications of the ACM
Extremal Combinatorial Problems in Relational Data Base
FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
On Interactions of Cardinality Constraints, Key, and Functional Dependencies
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Minimum Matrix Representation of Some Key System
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Functional Dependencies in Presence of Errors
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
Extremal Theorems for Databases
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
Functional dependencies distorted by errors
Discrete Applied Mathematics
New type of coding problem motivated by database theory
Discrete Applied Mathematics
Orthogonal double covers of general graphs
Discrete Applied Mathematics
Orthogonal double covers of Kn,n by small graphs
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
Coding theory motivated by relational databases
SDKB'10 Proceedings of the 4th international conference on Semantics in data and knowledge bases
Some contributions to the minimum representation problem of key systems
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
General Theory of Information Transfer and Combinatorics
Recent combinatorial results in the theory of relational databases
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.04 |
Let a be a column of the m x n matrix M and A a set of its columns. We say that A implies a iff M contains no two rows equal in A but different in a. It is easy to see that if @?"M(A) denotes the columns implied by A, than @?"M(A) is a closure operation. We say that M represents this closure operation. s() is the minimum number of the rows of the matrices representing a given closure operation. s(@?) is determined for some particular closure operations.