Performance evaluations on inner vs. outer decomposition first parallel join algorithms for two nested loop joins

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...

Full description

Saved in:
Bibliographic Details
Published inJournal of Central South University Vol. 21; no. 10; pp. 3873 - 3882
Main Authors Noh, Seo-Young, Yoon, Heejun, Yeo, Il-Yeon, Jeong, Yoon-su, Park, Hyungwoo
Format Journal Article
LanguageEnglish
Published Heidelberg Central South University 01.10.2014
Subjects
Engineering
Metallic Materials
outer decomposition
inner decomposition
parallel join performance
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2095-2899
2227-5223
DOI:10.1007/s11771-014-2374-9