download0 view136
twitter facebook

공공누리This item is licensed Korea Open Government License

Title
Performance evaluations on inner vs. outer decomposition first parallel join algorithms for two nested loop joins
Author(s)
노서영박형우여일연윤희준
Publication Year
2014-10-01
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.
Keyword
parallel join performance; inner decomposition; outer decomposition
Journal Title
Journal of Central South University
ISSN
2095-2899
Files in This Item:
There are no files associated with this item.
Appears in Collections:
7. KISTI 연구성과 > 학술지 발표논문
URI
https://repository.kisti.re.kr/handle/10580/14367
http://www.ndsl.kr/ndsl/search/detail/article/articleSearchResultDetail.do?cn=NART71783156
Export
RIS (EndNote)
XLS (Excel)
XML

Browse