On armstrong relations for strong dependencies

Authors:
Vu Duc Thi;Nguyen Hoang Son
Affiliations:
Institute of Information Technology, Vietnamese Academy of Science and Technology, Hanoi, Vietnam;Department of Mathematics, College of Sciences, Hue University, Vietnam
Venue:
Acta Cybernetica
Year:
2006

Citing 3
Cited 3

The minimal keys and antikeys

Acta Cybernetica
Strong dependencies and s-semilattices

Acta Informatica
Some problems related to keys and the Boyce-Codd normal form

Acta Cybernetica

Empirical evidence for the usefulness of Armstrong relations in the acquisition of meaningful functional dependencies

Information Systems
Design by example for SQL table definitions with functional dependencies

The VLDB Journal — The International Journal on Very Large Data Bases
On the existence of armstrong data trees for XML functional dependencies

FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The strong dependency has been introduced and axiomatized in [2], [3], [4], [5]. The aim of this paper is to investigate on Armstrong relations for strong dependencies. We give a necessary and sufficient condition for an abitrary relation to be Armstrong relation of a given strong scheme. We also give an effective algorithm finding a relation υ such that υ is Armstrong relation of a given strong scheme G = (U, S) (i.e. Sr = S, where Sr is a full family of strong dependencies of r, and Sis a set of all strong dependencies that can be derived from S by the system of axioms). We estimate this algorithm. We show that the time complexity of this algorithm is polynomial in |U| and |S|.