Properties of composite of closure operations and choice functions

Authors:
Nghia D. Vu;Bina Ramamurthy
Affiliations:
Department of Computer Science and Engineering, 201 Bell Hall, University at Buffalo, Buffalo, NY;Department of Computer Science and Engineering, 201 Bell Hall, University at Buffalo, Buffalo, NY
Venue:
Acta Cybernetica
Year:
2002

Citing 4
Cited 0

Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
Some results about normal forms for functional dependency in the relational datamodel

Discrete Applied Mathematics
Computational problems related to the design of normal form relational schemas

ACM Transactions on Database Systems (TODS)
On the Structure of Armstrong Relations for Functional Dependencies

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.01

Visualization

Abstract

The equivalence of the family of FDs is among many hottest topics that get a lot of attention and consideration currently. There are many equivalent descriptions of the family of FDs. The closure operation and choice function are two of them. Major results of this paper are the properties of the composite function of the choice functions and closure operations. The first parts of this paper address the theories of the composite function of two choice functions and the sufficient and necessary condition of a composite function of two choice functions to be a choice function. Rest of the paper addresses the sufficient and necessary condition of a composite function of more than two choice functions to be a choice function and a composite function of more than two closure operations to be a closure operation.