HYBRID JOIN - AN IMPROVED SORT-BASED JOIN ALGORITHM

作     者：CHOI, HK KIM, M 

作者机构：Dep. Electr. Eng. Korea Adv. Inst. Sci. and Technol. P.O. Box 150 Cheongryang Seoul 130-650 Rep. Korea 

出 版 物：《INFORMATION PROCESSING LETTERS》 (信息处理快报)

年 卷 期：1989年第32卷第2期

页      面：51-56页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Join algorithm relational database 

摘      要：This paper proposes an algorithm that improves the sort-based join method. Unlike the sort-based join, it employs both sorting and partitioning for avoiding two complete sorts of both relations, thus it will be referred to as hybrid join. The algorithm consists of completely sorting only the smaller relation and partitioning the other one into ranged buckets according to the order statistics of the sorted relation. The final join is performed on the sorted relation and the ranged buckets.