Research Repository

Performance analysis of "Groupby-After-Join" query processing in parallel database systems

Taniar, David Randy and Tan, Rebecca Boon Noi and Leung, Clement H. C and Liu, Kevin H (2004) Performance analysis of "Groupby-After-Join" query processing in parallel database systems. Information Sciences, 168 (1-4). pp. 25-50. ISSN 0020-0255

Full text for this resource is not available from the Research Repository.

Abstract

Queries containing aggregate functions often combine multiple tables through join operations. This query is subsequently called “Groupby-Join”. There is a special category of this query whereby the group-by operation can only be performed after the join operation. This is known as “Groupby-After-Join” queries––the focus of this paper. In parallel processing of such queries, it must be decided which attribute is used as a partitioning attribute, particularly join attribute or group-by attribute. Based on the partitioning attribute, two parallel processing methods, namely join partition method (JPM) and aggregate partition method (APM) are discussed. The behaviours of these parallelization methods are described in terms of cost models. Experiments are performed based on simulations. The simulation results show that the aggregate partition method performs better than the join partition method.

Item Type: Article
Uncontrolled Keywords: ResPubID18925, groupby queries, groupby-join queries, Parallel query processing, Parallel query optimization, Parallel databases, Performance analysis
Subjects: Faculty/School/Research Centre/Department > School of Engineering and Science
Depositing User: VUIR
Date Deposited: 27 Mar 2012 05:04
Last Modified: 18 Mar 2015 06:00
URI: http://vuir.vu.edu.au/id/eprint/2667
DOI: 10.1016/j.ins.2003.09.029
ePrint Statistics: View download statistics for this item
Citations in Scopus: 11 - View on Scopus

Repository staff only

View Item View Item

Search Google Scholar