Cited 0 time in webofscience Cited 2 time in scopus

A graph-based database partitioning method for parallel olap query processing

Title
A graph-based database partitioning method for parallel olap query processing
Authors
Nam, Yoon-MinKim, Min-SooHan, Donghyoung
DGIST Authors
Kim, Min-Soo
Issue Date
2018-04-19
Citation
IEEE International Conference on Data Engineering, 1037-1048
Type
Conference
Abstract
As the amount of data to process increases, a scalable and efficient horizontal database partitioning method becomes more important for OLAP query processing in parallel database platforms. Existing partitioning methods have a few major drawbacks such as a large amount of data redundancy and not supporting join processing without shuffle in many cases despite their large data redundancy. We elucidate the drawbacks arise from their tree-based partitioning schemes and propose a novel graph-based database partitioning method called GPT that improves query performance with lower data redundancy. Through extensive experiments using three benchmarks, we show that GPT significantly outperforms the state-of-The-Art method in terms of both storage overhead and query performance. ? 2018 IEEE.
URI
http://hdl.handle.net/20.500.11750/9501
DOI
10.1109/ICDE.2018.00096
Publisher
Institute of Electrical and Electronics Engineers Inc.
Files:
There are no files associated with this item.
Collection:
Department of Information and Communication EngineeringInfoLab2. Conference Papers


qrcode mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE