| OPTIMIZATION OF BIPARTITE JOINS WITH GRAPH THGORY |
| |
| 引用本文： | Zeag Yongning Tong Fu. OPTIMIZATION OF BIPARTITE JOINS WITH GRAPH THGORY[J]. 保鲜与加工, 1989, 0(2): 43-49 |
| |
| 作者姓名： | Zeag Yongning Tong Fu |
| |
| 作者单位： | Zeag Yongning Tong Fu |
| |
| 摘 要： | 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.
|
| 关 键 词： | database algorithm graph theory bipartite graph matching query processing query optimization |
OPTIMIZATION OF BIPARTITE JOINS WITH GRAPH THGORY |
| |
| Zeag Yongning Tong Fu. OPTIMIZATION OF BIPARTITE JOINS WITH GRAPH THGORY[J]. Storage & Process, 1989, 0(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 |
|
| 点击此处可从《保鲜与加工》浏览原始摘要信息 |
|
点击此处可从《保鲜与加工》下载全文 |
