Minimum matrix representation of closure operations

DOI10.1016/S0166-218X(85)80003-2MaRDI QIDQ1065561zbMATH OpenFDO

Authors J. Demetrovics, Zoltán Füredi, Gyula O. H. Katona

Publication date 1985

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

zbMATH Keywords

database

Mathematics Subject Classification ID

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

Recommendations

• On minimum matrix representation of closure operations
• Minimum matrix representation of Sperner systems
• Some Notes on Managing Closure Operators
• Bases of closure systems
• On the succinctness of closure operator representations

Cites work

• 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?)
• A note on minimal matrix representation of closure operations
• A relational model of data for large shared data banks
• Candidate Keys and Antichains
• 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

Cited in

(30)

• A survey of some combinatorial results concerning functional dependencies in database relations.
• Orthogonal double covers of \(K_{n,n}\) by small graphs.
• Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions
• scientific article; zbMATH DE number 1507288 (Why is no real title available?)
• Direct product decompositions of lattices, closures and relation schemes
• Coding theory motivated by relational databases
• Minimum matrix representation of Sperner systems
• The number of keys in relational and nested relational databases
• Orthogonal double covers of general graphs.
• Functional dependencies in relational databases: A lattice point of view
• SPT(q, k, n)-Codes
• Closed sets and translations of relation schemes
• On the Existence of Armstrong Instances with Bounded Domains
• On cyclic orthogonal double covers of circulant graphs by special infinite graphs
• Codes that attain minimum distance in every possible direction
• Design type problems motivated by database theory
• Minimum matrix representation of some key system
• Partitions with certain intersection properties
• Some combinatorial characteristics of closure operations
• Self-orthogonal decompositions of graphs into matchings
• On minimum matrix representation of closure operations
• Functional dependencies distorted by errors
• The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
• New type of coding problem motivated by database theory
• Minimal Armstrong databases for cardinality constraints
• Perfect error-correcting databases
• Controlling entity integrity with key sets
• Orthogonal double covers of complete graphs by trees
• On the one edge algorithm for the orthogonal double covers
• Recent combinatorial results in the theory of relational databases

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)