%0 Journal Article
%T ON THE EXISTENCE OF FINITE COMPLETE AXIOMATIZATION FOR TRANSITIVE CLOSURE AND FUNCTIONAL DEPENDENCIES<br>关于传递闭包和函数依赖完备公理系统存在问题研究
%A Nie Peiyao
%A <br>聂培尧
%J 软件学报
%D 1994
%I 
%X 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.
%K Database design
%K functional dependencies
%K transitive dosure
%K axiomatization systems<br>数据库设计，函数依赖，传递闭包，公理系统
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=813B1D1D7E03DFA9741ECF0C0CC2B5AD&yid=3EBE383EEA0A6494&vid=94C357A881DFC066&iid=38B194292C032A66&sid=42425781F0B1C26E&eid=ECE8E54D6034F642&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=11