首页 | 本学科首页   官方微博 | 高级检索  
     检索      

有选择条件的并行连接改进算法
引用本文:卢炎生,邹军华.有选择条件的并行连接改进算法[J].华中科技大学学报(自然科学版),2003,31(5):20-21,36.
作者姓名:卢炎生  邹军华
作者单位:华中科技大学计算机科学与技术学院
摘    要:针对有选择条件的连接易于造成选择率偏斜和重分布偏斜的问题,通过在各个处理结点中的A—D(Attribute—Distribute)临时关系以及主控结点中的A—RD(Attribute—Redistribute)临时关系,提出了并行连接改进算法,并且从理论上对该算法的空间复杂度进行了分析.

关 键 词:并行数据库  数据偏斜  并行连接算法
文章编号:1671-4512(2003)05-0020-02

The improved parallel join algorithm for selective condition
Lu Yansheng Zou Junhua Lu Yansheng Prof., College of Computer Sci. & Tech.,Huazhong Univ. of Sci. & Tech.,Wuhan ,China..The improved parallel join algorithm for selective condition[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2003,31(5):20-21,36.
Authors:Lu Yansheng Zou Junhua Lu Yansheng Prof  College of Computer Sci & Tech  Huazhong Univ of Sci & Tech  Wuhan  China
Institution:Lu Yansheng Zou Junhua Lu Yansheng Prof., College of Computer Sci. & Tech.,Huazhong Univ. of Sci. & Tech.,Wuhan 430074,China.
Abstract:To avoid selection skew and redistribution skew in joins where selections existed, the improved parallel join algorithms were discussed through the A-D (Attribute-distribute) temporary relations in the processing nodes and an A-RD (Attribute-Redistribute) temporary relation in a control node. The theoretical analysis of the spatial complexity of the algorithm was presented.
Keywords:parallel database  data skew  parallel join algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号