Sharing across Multiple MapReduce Jobs

Author:

Nykiel Tomasz1,Potamias Michalis2,Mishra Chaitanya3,Kollios George4,Koudas Nick1

Affiliation:

1. University of Toronto, Canada

2. Groupon

3. Facebook, Inc.

4. Boston University, MA

Abstract

Large-scale data analysis lies in the core of modern enterprises and scientific research. With the emergence of cloud computing, the use of an analytical query processing infrastructure can be directly associated with monetary cost. MapReduce has been a popular framework in the context of cloud computing, designed to serve long-running queries (jobs) which can be processed in batch mode. Taking into account that different jobs often perform similar work, there are many opportunities for sharing. In principle, sharing similar work reduces the overall amount of work, which can lead to reducing monetary charges for utilizing the processing infrastructure. In this article we present a sharing framework tailored to MapReduce, namely, <tt>MRShare</tt>. Our framework, <tt>MRShare</tt>, transforms a batch of queries into a new batch that will be executed more efficiently, by merging jobs into groups and evaluating each group as a single query. Based on our cost model for MapReduce, we define an optimization problem and we provide a solution that derives the optimal grouping of queries. Given the query grouping, we merge jobs appropriately and submit them to MapReduce for processing. A key property of <tt>MRShare</tt> is that it is independent of the MapReduce implementation. Experiments with our prototype, built on top of Hadoop, demonstrate the overall effectiveness of our approach. <tt>MRShare</tt> is primarily designed for handling I/O-intensive queries. However, with the development of high-level languages operating on top of MapReduce, user queries executed in this model become more complex and CPU intensive. Commonly, executed queries can be modeled as evaluating pipelines of CPU-expensive filters over the input stream. Examples of such filters include, but are not limited to, index probes, or certain types of joins. In this article we adapt some of the standard techniques for filter ordering used in relational and stream databases, propose their extensions, and implement them through <tt>MRAdaptiveFilter</tt>, an extension of <tt>MRShare</tt> for expensive filter ordering tailored to MapReduce, which allows one to handle both single- and batch-query execution modes. We present an experimental evaluation that demonstrates additional benefits of <tt>MRAdaptiveFilter</tt>, when executing CPU-intensive queries in <tt>MRShare</tt>.

Publisher

Association for Computing Machinery (ACM)

Subject

Information Systems

Reference58 articles.

1. HadoopDB

2. Optimizing joins in a map-reduce environment

3. Scheduling shared scans of large data files

4. Amazon. 2006. Amazon elastic compute cloud. http://aws.amazon.com/ec2/. Amazon. 2006. Amazon elastic compute cloud. http://aws.amazon.com/ec2/.

5. Eddies

Cited by 6 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Exploiting Sharing Join Opportunities in Big Data Multiquery Optimization with Flink;Complexity;2020-12-04

2. The optimization for recurring queries in big data analysis system with MapReduce;Future Generation Computer Systems;2018-10

3. EclipseMR: Distributed and Parallel Task Processing with Consistent Hashing;2017 IEEE International Conference on Cluster Computing (CLUSTER);2017-09

4. Generalization of Large-Scale Data Processing in One MapReduce Job for Coarse-Grained Parallelism;International Journal of Parallel Programming;2016-07-15

5. MEMoMR: Accelerate MapReduce via reuse of intermediate results;Concurrency and Computation: Practice and Experience;2015-10-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3