loading...
Parallel Processing of "GroupBy-Before-Join" Queries in Cluster Architecture
Brisbane, Australia May 15-May 18
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCGRID.2001.923191First IEEE International Symposium on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
David Taniar, Monash University
J. Wenny Rahayu, La Trobe University
SQL queries in the real world are replete with group-by and join operations. This type of queries is often known as "GroupBy-Join" queries. In some GroupBy-Join queries, it is desirable to perform group-by before join in order to achieve better performance. This subset of GroupBy-Join queries is called "GroupBy-Before-Join" queries. In this paper, we present a study on parallelization of GroupBy-Before-Join queries, particularly by exploiting cluster architectures. From our study, we have learned that in parallel query optimization, processing group-by as early as possible is not always desirable. In many occasions, performing data distribution first before group-by offers performance advantages. In this study, we also describe our cluster-based scheme.
Citation:
David Taniar, J. Wenny Rahayu, "Parallel Processing of "GroupBy-Before-Join" Queries in Cluster Architecture," ccgrid, pp.178, First IEEE International Symposium on Cluster Computing and the Grid (CCGrid'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.