Performance evaluations on inner vs. outer decomposition first parallel join algorithms for two nested loop joins
来源期刊：中南大学学报(英文版)2014年第10期
论文作者：Seo-Young NOH Heejun YOON Il-Yeon YEO Yoon-su JEONG Hyungwoo PARK
文章页码：3873 - 3882
Key words：parallel join performance; inner decomposition; outer decomposition
Abstract: Two popular traditional join algorithms and their parallel versions are introduced. When designing join algorithms in serial computing environment, decomposing inner relation is considered as the right direction to save disk I/Os. However, two different decomposition algorithms are compared, such as inner vs. outer decomposition first algorithms for tuple-based and block-based nested loop joins, showing that the proposed approach is 20% better than general approach. Also lemmas are proved, when we have to use the outer decomposition first parallel join algorithms.
Seo-Young NOH1, Heejun YOON1, Il-Yeon YEO1, Yoon-su JEONG2, Hyungwoo PARK1
(1. National Institute of Supercomputing and Networking,
Korea Institute of Science and Technology Information, Daejeon 305-806, Korea;
2. Department of Information Communication Engineering, Mokwon University,
21 Mokwon-gil, Seo-gu, Daejeon 302-318, Korea)
Abstract:Two popular traditional join algorithms and their parallel versions are introduced. When designing join algorithms in serial computing environment, decomposing inner relation is considered as the right direction to save disk I/Os. However, two different decomposition algorithms are compared, such as inner vs. outer decomposition first algorithms for tuple-based and block-based nested loop joins, showing that the proposed approach is 20% better than general approach. Also lemmas are proved, when we have to use the outer decomposition first parallel join algorithms.
Key words:parallel join performance; inner decomposition; outer decomposition
