Thuật toán xác định bao đóng và khóa theo tiếp cận hợp giải trong lớp các phụ thuộc logic

Abstract

The algorithms for closures and keys in relation schemas with functional dependencies are well-known in theory of relational databases. However, the problems of closures and keys in relation schemas with positive Boolean dependencies are still opened. This paper proposes a solution to these problems. The results are presented by unification method which is a new technique to construct the basic algorithms for logic dependencies in data and knowledge bases.