Strategic decision making process uses a lot of GroupBy clauses and join operations queries. As the source of information in this type of application to these queries is commonly very huge, then parallelization of GroupBy-Join queries is unavoidable in order to speed up query processing time. In this paper, we investigate three parallelization techniques for GroupBy-Join queries, particularly the queries where the group-by clause can be performed before the join operation. We subsequently call this query “GroupBy-Before-Join” queries. Performance evaluation of the three parallel processing methods is also carried out and presented here.
%0 Book Section
%1 springerlink:10.1007/3-540-48228-8_25
%A Taniar, David
%A Rahayu, J.
%A Ekonomosa, Hero
%B High-Performance Computing and Networking
%C Berlin / Heidelberg
%D 2001
%E Hertzberger, Bob
%E Hoekstra, Alfons
%E Williams, Roy
%I Springer
%K evaluation groupby join parallel performance
%P 241-250
%R 10.1007/3-540-48228-8_25
%T Performance Evaluation of Parallel GroupBy-Before-Join Query Processing in High Performance Database Systems
%U http://dx.doi.org/10.1007/3-540-48228-8_25
%V 2110
%X Strategic decision making process uses a lot of GroupBy clauses and join operations queries. As the source of information in this type of application to these queries is commonly very huge, then parallelization of GroupBy-Join queries is unavoidable in order to speed up query processing time. In this paper, we investigate three parallelization techniques for GroupBy-Join queries, particularly the queries where the group-by clause can be performed before the join operation. We subsequently call this query “GroupBy-Before-Join” queries. Performance evaluation of the three parallel processing methods is also carried out and presented here.
%@ 978-3-540-42293-8
@incollection{springerlink:10.1007/3-540-48228-8_25,
abstract = {Strategic decision making process uses a lot of GroupBy clauses and join operations queries. As the source of information in this type of application to these queries is commonly very huge, then parallelization of GroupBy-Join queries is unavoidable in order to speed up query processing time. In this paper, we investigate three parallelization techniques for GroupBy-Join queries, particularly the queries where the group-by clause can be performed before the join operation. We subsequently call this query “GroupBy-Before-Join” queries. Performance evaluation of the three parallel processing methods is also carried out and presented here.},
added-at = {2011-11-29T09:08:02.000+0100},
address = {Berlin / Heidelberg},
affiliation = {School of Business Systems, Monash University, Vic, 3800 Australia},
author = {Taniar, David and Rahayu, J. and Ekonomosa, Hero},
biburl = {https://www.bibsonomy.org/bibtex/27f4d4bcf989c149d4c77a1b056c0d189/praveen},
booktitle = {High-Performance Computing and Networking},
doi = {10.1007/3-540-48228-8_25},
editor = {Hertzberger, Bob and Hoekstra, Alfons and Williams, Roy},
interhash = {bab106254bc996169aabb9693473e0e2},
intrahash = {7f4d4bcf989c149d4c77a1b056c0d189},
isbn = {978-3-540-42293-8},
keyword = {Computer Science},
keywords = {evaluation groupby join parallel performance},
pages = {241-250},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2011-11-29T09:08:02.000+0100},
title = {Performance Evaluation of Parallel GroupBy-Before-Join Query Processing in High Performance Database Systems},
url = {http://dx.doi.org/10.1007/3-540-48228-8_25},
volume = 2110,
year = 2001
}