On minimum matrix representation of closure operations

DOI10.1016/0166-218X(90)90018-8zbMath0724.05011OpenAlexW2053929761WikidataQ126975490 ScholiaQ126975490MaRDI QIDQ2276961

Lisheng Wu, Frank E. Bennett

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90018-8

zbMATH Keywords

closure operationrelational data baserepresentation by matrices

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Related Items (14)

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 ⋮ General symmetric starter of orthogonal double covers of complete bipartite graph ⋮ Orthogonal double covers of \(K_{n,n}\) by small graphs. ⋮ Orthogonal double covers of general graphs. ⋮ Combinatorial filing schemes with fewer buckets and improved redundancy and construction characteristics ⋮ Coding Theory Motivated by Relational Databases ⋮ Partitions with certain intersection properties ⋮ Design type problems motivated by database theory

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum matrix representation of closure operations
• Balanced incomplete block designs and related designs
• Group divisible designs with block-size four
• Optimal packings of \(K_4\)'s into a \(K_n\)
• Almost resolvable decomposition of K//n*
• Candidate Keys and Antichains

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