| 连接依赖的蕴涵问题及其推导公理系统 |
| |
| 引用本文： | 李星野,胡久稔.连接依赖的蕴涵问题及其推导公理系统[J].计算机学报,1995,18(1):56-60. |
| |
| 作者姓名： | 李星野 胡久稔 |
| |
| 作者单位： | 辽宁工学院基础部，南开数学研究所 |
| |
| 摘 要： | 本文首先证明了一个连接依赖集等价于一个连接依赖；根据这一结果，可以构造一个不用追踪判定连接依赖蕴涵问题的方法，然后，本文给出了一个新的连接依赖的推导公理系统，并证明了这一系统的合理性和完全性。
|
| 关 键 词： | 连接依赖 蕴涵问题 推导公理系统 关系数据库 |
IMPLICATION PROBLEM AND FORMAL SYSTEM OF JOIN DEPENDENCY |
| |
| Li Xingye.IMPLICATION PROBLEM AND FORMAL SYSTEM OF JOIN DEPENDENCY[J].Chinese Journal of Computers,1995,18(1):56-60. |
| |
| Authors: | Li Xingye |
| |
| Abstract: | In this paper, it is proved that a set of join dependencies is equivalent to a join dependency at first. Thus, one can construct a decision method of the implication problem for dependencieswithout using the chase process, Then, a new formal system for join dependencies is presented and it is proved that this system is sound and complete. |
| |
| Keywords: | Total tuple generating dependency join dependency implication problem formal system |
| 本文献已被 CNKI 维普 等数据库收录！ |
