###
DOI:
:1994.5(3):37-42

关于传递闭包和函数依赖完备公理系统存在问题研究
聂培尧
(山东财政学院,济南 250014)
ON THE EXISTENCE OF FINITE COMPLETE AXIOMATIZATION FOR TRANSITIVE CLOSURE AND FUNCTIONAL DEPENDENCIES
Nie Peiyao
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 2717   Download 2702
Received:August 26, 1991    Revised:November 15, 1991
> 中文摘要: 数据依赖在数据库设计中起着十分重要的作用.自Codd提出函数依赖(FDs)、Fagin引入多值依赖(MVDs)后,近几年来人们又根据设计中的需要引入多种新的依赖,如在工程数据库设计中所引进的传递闭包依赖(CDs)等.对这些依赖一般是按其是否具有完备的公理系统而划分为两大类,因为完备性公理系统往往具有有效的判定算法为先决条件.本文对CDs和FDs的k元完备公理系统存在问题进行了研究,证明了CDs和FDs不具有共同的k元完备公理系统这一结论.
Abstract: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.
文章编号:     中图分类号:    文献标志码:
基金项目:
Foundation items:
Author NameAffiliation
Nie Peiyao 山东财政学院济南 250014 
Reference text:

聂培尧.关于传递闭包和函数依赖完备公理系统存在问题研究.软件学报,1994,5(3):37-42

Nie Peiyao.ON THE EXISTENCE OF FINITE COMPLETE AXIOMATIZATION FOR TRANSITIVE CLOSURE AND FUNCTIONAL DEPENDENCIES.Journal of Software,1994,5(3):37-42