Problem Decomposition Method to Compute an Optimal Cover for a Set of Functional Dependencies

Vitalie Cotelea ()
Additional contact information
Vitalie Cotelea: Academy of Economic Studies of MOLDOVA

Database Systems Journal, 2011, vol. 2, issue 4, 17-30

Abstract: The paper proposes a problem decomposition method for building optimal cover for a set of functional dependencies to decrease the solving time. At the beginning, the paper includes an overview of the covers of functional dependencies. There are considered definitions and properties of non redundant covers for sets of functional dependencies, reduced and canonical covers as well as equivalence classes of functional dependencies, minimum and optimal covers. Then, a theoretical tool for inference of functional dependencies is proposed, which possesses the uniqueness property. And finally, the set of attributes of the relational schema is divided into equivalence classes of attributes that will serve as the basis for building optimal cover for a set of functional dependencies.

Keywords: Logical Database Design; Functional Dependencies; Optimal Cover; Problem Decomposition (search for similar items in EconPapers)
Date: 2011
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dbjournal.ro/archive/6/3_Cotelea.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:aes:dbjour:v:2:y:2011:i:4:p:17-30

Access Statistics for this article

Database Systems Journal is currently edited by Ion Lungu

More articles in Database Systems Journal from Academy of Economic Studies - Bucharest, Romania Contact information at EDIRC.
Bibliographic data for series maintained by Adela Bara ().