| 数据库查询无损联结的求解算法及应用 |
| |
| 引用本文： | 王兰成.数据库查询无损联结的求解算法及应用[J].现代图书情报技术,1995,11(6):20-23. |
| |
| 作者姓名： | 王兰成 |
| |
| 作者单位： | (空军政治学院信息管理系 上海 200433) |
| |
| 摘 要： | 本文研究任意范式下求解查询无损联结最小覆盖序列的问题, 介绍查询无损联结检验的算法和基于检验算法求解查询无损联结最小覆盖序列的算法, 同时给出应用实例和证明。
|
| 关 键 词： | 数据库 查询无损联结 算法 计算机应用 |
| 收稿时间： | 1995-04-17 |
AN ALGORITHIM FOR SOLVING MINIMAL COVERS OF QUERY LOSSLESS JOIN ON DATABASE |
| |
| Wang Lancheng.AN ALGORITHIM FOR SOLVING MINIMAL COVERS OF QUERY LOSSLESS JOIN ON DATABASE[J].New Technology of Library and Information Service,1995,11(6):20-23. |
| |
| Authors: | Wang Lancheng |
| |
| Institution: | (Airforce Political Univ ersity, Shanghai) |
| |
| Abstract: | The question of solving minimal covers of query lossless join about any normal form has been researched. The algorithims of the verify of query lossless join, the solution of minimal covers of query lossless join based on divided relations and the algorithim of the verify,have been introduced and confirmed. |
| |
| Keywords: | |
| 本文献已被 维普 等数据库收录！ |
| 点击此处可从《现代图书情报技术》浏览原始摘要信息 |
| 点击此处可从《现代图书情报技术》下载免费的PDF全文 |
