Minimum matrix representation of closure operations

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

Zoltan Fueredi, Janos Demetrovics, Gyula O. H. Katona

Publication date: 1985

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

zbMATH Keywords

database

Mathematics Subject Classification ID

05A99: Enumerative combinatorics

68P05: Data structures

68P20: Information storage and retrieval of data

Related Items

Unnamed Item, ON THE ONE EDGE ALGORITHM FOR THE ORTHOGONAL DOUBLE COVERS, On the Existence of Armstrong Instances with Bounded Domains, Controlling entity integrity with key sets, Recent combinatorial results in the theory of relational databases, Closed sets and translations of relation schemes, 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

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