Efficiently analyzing data on a large scale can be vital for data owners to gain useful business intelligence. One of the most common datasets used to gain business intelligence is event log files. Oftentimes, records in event log files that are time sorted, need to be grouped by user ID or transaction ID in order to mine user behaviors, such as click through rate, while preserving the time order. This kind of analytical workload is here referred to as RElative Order-pReserving based Grouping (Re-Org). Using MapReduce/Hadoop, a popular big data analysis tool, in an as-is manner for executing Re-Org tasks on ordered datasets is not efficient due to its internal sort-merge mechanism. We propose a framework that adopts an efficient group-order-merge mechanism to provide faster execution of Re-Org tasks and implement it by extending Hadoop. Experimental results show a 2.2x speedup over executing Re-Org tasks in plain vanilla Hadoop.
[1]
Yanfeng Zhang,et al.
PrIter: A Distributed Framework for Prioritizing Iterative Computations
,
2011,
IEEE Transactions on Parallel and Distributed Systems.
[2]
Sanjay Ghemawat,et al.
MapReduce: Simplified Data Processing on Large Clusters
,
2004,
OSDI.
[3]
Yanfeng Zhang,et al.
iMapReduce: A Distributed Computing Framework for Iterative Computation
,
2011,
Journal of Grid Computing.
[4]
Tom White,et al.
Hadoop: The Definitive Guide
,
2009
.
[5]
Geoffrey C. Fox,et al.
Twister: a runtime for iterative MapReduce
,
2010,
HPDC '10.
[6]
Markus Kurscheidt,et al.
The World Cup
,
2006
.
[7]
Lixin Gao,et al.
Accelerating Expectation-Maximization Algorithms with Frequent Updates
,
2012,
2012 IEEE International Conference on Cluster Computing.