The poset of closures as a model of changing databases
From MaRDI portal
Publication:1104951
DOI10.1007/BF00337692zbMath0648.06004OpenAlexW2059867571MaRDI QIDQ1104951
Gustav Burosch, Janos Demetrovics, Gyula O. H. Katona
Publication date: 1987
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00337692
Partial orders, general (06A06) Information storage and retrieval of data (68P20) Galois correspondences, closure operators (in relation to ordered sets) (06A15)
Related Items (16)
The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey ⋮ Closure systems, implicational systems, overhanging relations and the case of hierarchical classification ⋮ Family of functional dependencies and its equivalent descriptions ⋮ A survey of some combinatorial results concerning functional dependencies in database relations. ⋮ On the number of databases and closure operations ⋮ Unnamed Item ⋮ Minimum matrix representation of Sperner systems ⋮ Some results about normal forms for functional dependency in the relational datamodel ⋮ On the distance of databases ⋮ The presence of lattice theory in discrete problems of mathematical social sciences. Why. ⋮ Some problems concerning keys for relation schemes and relations in the relational datamodel ⋮ Functional dependencies distorted by errors ⋮ Functional dependencies in relational databases: A lattice point of view ⋮ Generalized domination in closure systems ⋮ Dependency types ⋮ Algorithms for generating an Armstrong relation and inferring functional dependencies in the relational datamodel
Cites Work
This page was built for publication: The poset of closures as a model of changing databases
