Please use this identifier to cite or link to this item:
|Title:||Fully dynamic partitioning: Handling data skew in parallel data cube computation|
|Authors:||Lu, H. |
|Citation:||Lu, H., Yu, J.X., Feng, L., Li, Z. (2003). Fully dynamic partitioning: Handling data skew in parallel data cube computation. Distributed and Parallel Databases 13 (2) : 181-202. ScholarBank@NUS Repository. https://doi.org/10.1023/A:1021567425133|
|Abstract:||Parallel data processing is a promising approach for efficiently computing data cube in relational databases, because most aggregate functions used in OLAP (On-Line Analytical Processing) are distributive functions. This paper studies the issues of handling data skew in parallel data cube computation. We present a fully dynamic partitioning approach that can effectively distribute workload among processing nodes without priori knowledge of data distribution. As supplement, a simple and effective dynamic load balancing mechanism is also incorporated into our algorithm, which further improves the overall performance. Our experimental results indicated that the proposed techniques are effective even when high data skew exists. The results of scale-up and speedup tests are also satisfactory.|
|Source Title:||Distributed and Parallel Databases|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Oct 17, 2018
WEB OF SCIENCETM
checked on Oct 10, 2018
checked on Sep 29, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.