Data Cube Materialization and Mining over MapReduce

doi:10.1109/TKDE.2011.257

Data Cube Materialization and Mining over MapReduce

2012-10-01

29

OA

AI

DOI：10.1109/TKDE.2011.257

原文链接

原文求助

摘要

En 中文

Computing interesting measures for data cubes and subsequent mining of interesting cube groups over massive data sets are critical for many important analyses done in the real world. Previous studies have focused on algebraic measures such as SUM that are amenable to parallel computation and can easily benefit from the recent advancement of parallel computing infrastructure such as MapReduce. Dealing with holistic measures such as TOP-K, however, is nontrivial. In this paper, we detail real-world challenges in cube materialization and mining tasks on web-scale data sets. Specifically, we identify an important subset of holistic measures and introduce MR-Cube, a MapReduce-based framework for efficient cube computation and identification of interesting cube groups on holistic measures. We provide extensive experimental analyses over both real and synthetic data. We demonstrate that, unlike existing techniques which cannot scale to the 100 million tuple mark for our data sets, MR-Cube successfully and efficiently computes cubes with holistic measures over billion-tuple data sets.

Keyword:

Data cube

cube materialization

cube mining

MapReduce

holistic measures

Data Cube Materialization and Mining over MapReduce

摘要

期刊

机构