ON THE EXISTENCE OF FINITE COMPLETE AXIOMATIZATION FOR TRANSITIVE CLOSURE AND FUNCTIONAL DEPENDENCIES
关于传递闭包和函数依赖完备公理系统存在问题研究

Closure dependencies, or CDs, are introduced to capture formally transitive closure relationships between attributes of a relational schema. The problem of a finite complete axiomatization for the interaction of CDs with functional dependencies (FDs) is investigated, leading to a negative result for the existence of a k-ary axiomatization for CDs and FDs taken together, in which every rule is k-ary for some fixed k.