| 偶查询优化的图论方法 |
| |
| 引用本文： | 曾永宁. 偶查询优化的图论方法[J]. 重庆大学学报(自然科学版), 1989, 12(2): 43-49 |
| |
| 作者姓名： | 曾永宁 |
| |
| 作者单位： | 重庆大学计算机系(曾永宁)，重庆大学计算机系(童頫) |
| |
| 摘 要： | 本文针对一类特殊的多关系查询——偶查询,提出了一种建立在图论偶图和匹配理论基础上的查询优化方法,这种方法具有多项式复杂性。
|
| 关 键 词： | 查询 优化 图论 偶图 数据库 |
OPTIMIZATION OF BIPARTITE JOINS WITH GRAPH THGORY |
| |
| Zeag Yongning Tong Fu. OPTIMIZATION OF BIPARTITE JOINS WITH GRAPH THGORY[J]. Journal of Chongqing University(Natural Science Edition), 1989, 12(2): 43-49 |
| |
| Authors: | Zeag Yongning Tong Fu |
| |
| Affiliation: | Zeag Yongning Tong Fu |
| |
| Abstract: | An optimization approach for multi-relational joins based onthe matching concept in graph theory is introduced. The basic idea lies in constructing a join graph from an expression of N-relation query, and seeking for a maximun matching with minimun total weight. The algorithm for bipartition(X, Y) is proposed in this paper. |
| |
| Keywords: | database algorithm graph theory bipartite graph matching query processing query optimization |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《重庆大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《重庆大学学报(自然科学版)》下载全文 |
