Direct product decompositions of lattices, closures and relation schemes

DOI10.1016/0012-365X(93)90228-LzbMath0780.06003OpenAlexW2057592956MaRDI QIDQ1210557

Leonid O. Libkin

Publication date: 30 August 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90228-l

zbMATH Keywords

closure operationspolynomial algorithmlattices of closed setsdirect product decompositionsrelational database schemes

Mathematics Subject Classification ID

Database theory (68P15) Structure theory of lattices (06B05) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (2)

Direct decompositions of atomistic algebraic lattices ⋮ Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Design by example: An application of Armstrong relations
• A decomposition of distributive lattices
• Minimum matrix representation of closure operations
• On the size of nonredundant FD-covers
• On clustering problems with connected optima in Euclidean spaces
• On the Structure of Armstrong Relations for Functional Dependencies
• Maximal Sublattices of Finite Distributive Lattices. II

This page was built for publication: Direct product decompositions of lattices, closures and relation schemes