| 改进的多连接算法:Jive |
| |
| 引用本文： | 周英飚,倪志鹏.改进的多连接算法:Jive[J].计算机工程与应用,2006,42(12):180-182. |
| |
| 作者姓名： | 周英飚 倪志鹏 |
| |
| 作者单位： | 华中科技大学计算机学院,武汉,430074 |
| |
| 摘 要： | 新的利用连接索引的算法Jive,它用中间产生的临时文件和分割输出连接结果的方法,采用已有的数据结构-连接索引,只需要对输入关系的一次扫描,即可完成连接.在一般情况下优于Valduriez(1987)所提出的连接算法,在输入关系很大的情况下性能尤为突出。
|
| 关 键 词： | 查询 多连接 连接索引 |
| 文章编号： | 1002-8331-（2006）12-0180-03 |
| 收稿时间： | 2005-07 |
| 修稿时间： | 2005-07 |
Optimized Join Algorithm: Jive |
| |
| Zhou Yingbiao,Ni Zhipeng.Optimized Join Algorithm: Jive[J].Computer Engineering and Applications,2006,42(12):180-182. |
| |
| Authors: | Zhou Yingbiao Ni Zhipeng |
| |
| Affiliation: | The Computer College of Huazhong Technology University,Wuhan 430074 |
| |
| Abstract: | By storing the intermediate results as temporary files and outputting the final join results in partitions,the new join algorithm Jive which uses the existed data struct join index,requires only one pass through each input relation to complete the join.In most situations,it has better performance than the algorithm proposed by Valduriez(1987),and it performs best when the input relation is very large. |
| |
| Keywords: | query multi-join join index |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
