In:
Proceedings of the VLDB Endowment, Association for Computing Machinery (ACM), Vol. 5, No. 2 ( 2011-10), p. 109-120
Abstract:
MapReduce is becoming the de facto framework for storing and processing massive data, due to its excellent scalability, reliability, and elasticity. In many MapReduce applications, obtaining a compact accurate summary of data is essential. Among various data summarization tools, histograms have proven to be particularly important and useful for summarizing data, and the wavelet histogram is one of the most widely used histograms. In this paper, we investigate the problem of building wavelet histograms efficiently on large datasets in MapReduce. We measure the efficiency of the algorithms by both end-to-end running time and communication cost. We demonstrate straightforward adaptations of existing exact and approximate methods for building wavelet histograms to MapReduce clusters are highly inefficient. To that end, we design new algorithms for computing exact and approximate wavelet histograms and discuss their implementation in MapReduce. We illustrate our techniques in Hadoop, and compare to baseline solutions with extensive experiments performed in a heterogeneous Hadoop cluster of 16 nodes, using large real and synthetic datasets, up to hundreds of gigabytes. The results suggest significant (often orders of magnitude) performance improvement achieved by our new algorithms.
Type of Medium:
Online Resource
ISSN:
2150-8097
DOI:
10.14778/2078324.2078327
Language:
English
Publisher:
Association for Computing Machinery (ACM)
Publication Date:
2011
detail.hit.zdb_id:
2478691-3
Bookmarklink
