Các phụ thuộc yếu trong mô hình dữ liệu quan hệ

Vu Duc Thi, Nguyen Kim Anh


One of  the main concepts in relational database theory is the full family of functional dependencies, that was first axiomatized by W.W.Armstrong [1].

The full family of weak dependencies have also been introduced and axiomatized [4, 5].

In this paper, we give some new results about weak dependencies. We give a necessary and sufficient condition for W+R = W+, and then we construct an effective combinatorial algorithms to  determine irredundant relation R’ for an arbitrary given relation R such that R’ Í R, W+R’ = W+R.

Full Text:


DOI: https://doi.org/10.15625/1813-9663/6/4/11151 Display counter: Abstract : 42 views. PDF : 31 views.

Journal of Computer Science and Cybernetics ISSN: 1813-9663

Published by Vietnam Academy of Science and Technology