Minimum matrix representation of closure operations

DOI10.1016/S0166-218X(85)80003-2zbMath0577.68084MaRDI QIDQ1065561

Zoltan Fueredi, Janos Demetrovics

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

database

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (28)

New type of coding problem 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. ⋮ Recent combinatorial results in the theory of relational databases ⋮ Orthogonal double covers of complete graphs by trees ⋮ Minimum matrix representation of Sperner systems ⋮ On cyclic orthogonal double covers of circulant graphs by special infinite graphs ⋮ SPT(q, k, n)-Codes ⋮ Controlling entity integrity with key sets ⋮ Codes that attain minimum distance in every possible direction ⋮ Orthogonal double covers of \(K_{n,n}\) by small graphs. ⋮ Orthogonal double covers of general graphs. ⋮ Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions ⋮ ON THE ONE EDGE ALGORITHM FOR THE ORTHOGONAL DOUBLE COVERS ⋮ Functional dependencies distorted by errors ⋮ 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 ⋮ On minimum matrix representation of closure operations ⋮ On the Existence of Armstrong Instances with Bounded Domains ⋮ Closed sets and translations of relation schemes ⋮ Perfect error-correcting databases ⋮ Coding Theory Motivated by Relational Databases ⋮ Unnamed Item ⋮ Partitions with certain intersection properties ⋮ Design type problems motivated by database theory ⋮ Self-orthogonal decompositions of graphs into matchings

Cites Work

• A note on minimal matrix representation of closure operations
• On the number of maximal dependencies in a data base relation of fixed order
• On resolvable balanced incomplete block designs
• The Existence and Construction of Balanced Incomplete Block Designs
• Candidate Keys and Antichains
• A relational model of data for large shared data banks
• On cliques in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum matrix representation of closure operations