一种关系式JOIN算法的研究与实践  

RESEARCH AND PRACTICE OF A JOIN ALGORITHM IN RELATIONAL OPERATION

作　　者：苏金泉[1] 苏厚勤[2] 

机构地区：[1]上海市计算技术研究所,上海200040 [2]东华大学计算机科学与技术学院,上海200051

出　　处：《计算机应用与软件》2007年第6期145-146,155,共3页Computer Applications and Software

摘　　要：关系式数据库管理系统中经常使用Join运算,因其常常耗费系统的大量资源,是研究关系式运算及其性能方面的聚焦点之一[1～4]。通过分析Merge-Join算法[4,7,8]和SDC算法[1],提出一种在处理速度上更快的Join算法,并在算法复杂性和处理性能上进行了比较,结果表明所给出的Join算法能够使Join性能明显改进。Join operation is most commonly used in Relational Database Management System. Since it always exhausts much resource of processing system, it has become one of the focuses in research on relational operation and performance. Based on the analysis of the Merge-Join and SDC algorithm which has been published domestically, a faster Join algorithm is presented in this article and its complexity and performance is also illustrated. The practice result shows that the performance of Join operation can be improved in evidence when the Join algorithm presented in this article is applied.

关 键 词：关系式数据库 关系式运算 连接算法 

分 类 号：TP311.132[自动化与计算机技术—计算机软件与理论]