Minimum matrix representation of closure operations
Let a be a column of the matrix M and A be 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 \(L_ M(A)\) denotes the columns implied by A, then \(L_ M(A)\) is a closure operation. We say in this case that M represents this closure operation. Let s(L) denote the minimum number of rows of the matrices representing a given closure operation L. The paper contains three types of results. In section 3 s(L) is determined for some special closure operations. In section 4, \(s(L_ 1\times L_ 2)\) is given in terms of \(s(L_ 1)\) and \(s(L_ 2)\). Finally closure operations L with large s(L) are considered.
- A note on minimal matrix representation of closure operations
- A relational model of data for large shared data banks
- Candidate Keys and Antichains
- scientific article; zbMATH DE number 3843181 (Why is no real title available?)
- scientific article; zbMATH DE number 3876648 (Why is no real title available?)
- scientific article; zbMATH DE number 3666227 (Why is no real title available?)
- scientific article; zbMATH DE number 3731387 (Why is no real title available?)
- scientific article; zbMATH DE number 3464827 (Why is no real title available?)
- On cliques in graphs
- On resolvable balanced incomplete block designs
- On the number of maximal dependencies in a data base relation of fixed order
- The Existence and Construction of Balanced Incomplete Block Designs
- Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions
- Functional dependencies in relational databases: A lattice point of view
- The number of keys in relational and nested relational databases
- Direct product decompositions of lattices, closures and relation schemes
- Design type problems motivated by database theory
- The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
- Minimum matrix representation of some key system
- A survey of some combinatorial results concerning functional dependencies in database relations.
- Orthogonal double covers of complete graphs by trees
- Minimum matrix representation of Sperner systems
- Orthogonal double covers of \(K_{n,n}\) by small graphs.
- Orthogonal double covers of general graphs.
- On cyclic orthogonal double covers of circulant graphs by special infinite graphs
- Perfect error-correcting databases
- New type of coding problem motivated by database theory
- On minimum matrix representation of closure operations
- Codes that attain minimum distance in every possible direction
- Functional dependencies distorted by errors
- Coding theory motivated by relational databases
- Partitions with certain intersection properties
- Self-orthogonal decompositions of graphs into matchings
- SPT(q, k, n)-Codes
- scientific article; zbMATH DE number 1507288 (Why is no real title available?)
- Some combinatorial characteristics of closure operations
- On the one edge algorithm for the orthogonal double covers
- On the Existence of Armstrong Instances with Bounded Domains
- Recent combinatorial results in the theory of relational databases
- Controlling entity integrity with key sets
- Minimal Armstrong databases for cardinality constraints
- Closed sets and translations of relation schemes
This page was built for publication: Minimum matrix representation of closure operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065561)
