In this paper we present the semilattice-theoretical approach to the investigation of the relational datamodels. It is known that the poset of closures is a model of changing databases. We show that it is in fact a lattice isomorphic to the subsemilattice-lattice of free semilattice, and the arbitrary subsemilattice-lattices can be considered as a model of restrictedly changing databases. The properties of these lattices in the context of database problems are studied. We also discuss the separation and dimension problems and establish some estimates.
CITATION STYLE
Demetrovics, J., Libkin, L. O., & Muchnik, I. B. (1989). Functional dependencies and the semilattice of closed classes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 364 LNCS, pp. 136–147). Springer Verlag. https://doi.org/10.1007/3-540-51251-9_10
Mendeley helps you to discover research relevant for your work.