Some problems on the functional dependency related to armstrong relations in the relational datamodel.
Author affiliations
DOI:
https://doi.org/10.15625/1813-9663/14/1/7876Abstract
In the paper, we give some results to combinatorial algorithms for functional dependency (FD for short) connecting the construction of Armstrong relations, relation schemes, the FD-relation implication problem, and the FD-relation equivalence problem. These algorithms play important roles in logical and structural investigations of the relational data model. Now, they are know to have exponential complexity. However, in this paper we show that if relations and relations schemes satisfy certain additional properties, then above problems are solved in polynomial time.Key Words and Phrases: relation, relational datamodel, functional dependency, relation scheme, generating Armstrong relation, dependency inference, FD-relation implication scheme problem, FD-relation equivalence problem, minimal Armstrong relation, closed set, minimal generator, key, minimal key, antikey.
Metrics
Metrics Loading ...
Downloads
Published
14-03-2016
How to Cite
[1]
V. D. Thi, “Some problems on the functional dependency related to armstrong relations in the relational datamodel”., JCC, vol. 14, no. 1, pp. 1–8, Mar. 2016.
Issue
Section
Computer Science
License
1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.
