On the number of databases and closure operations

DOI10.1016/0304-3975(91)90359-AzbMath0717.68019MaRDI QIDQ2638763

Daniel J. Kleitman, Gustav Burosch, Alexander A. Sapozhenko, Janos Demetrovics, Gyula O. H. Katona

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Closure operations

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (8)

The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey ⋮ A survey of some combinatorial results concerning functional dependencies in database relations. ⋮ Functional dependencies among Boolean dependencies ⋮ Recursive decomposition and bounds of the lattice of Moore co-families. ⋮ Succinctness and tractability of closure operator representations ⋮ Recursive decomposition tree of a Moore co-family and closure algorithm. ⋮ On the complexity of inferring functional dependencies ⋮ On the number of union-free families

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The poset of closures as a model of changing databases
• Extremal properties of collections of subsets containing no two sets and their union
• On Dedekind's Problem: The Number of Monotone Boolean Functions
• A relational model of data for large shared data banks

This page was built for publication: On the number of databases and closure operations