The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Profiling, what-if analysis, and cost-based optimization of MapReduce programs
Abstract
MapReduce has emerged as a viable competitor to database systems in big data analytics. MapReduce programs are being written for a wide variety of application domains including business data processing, text analysis, natural language processing, Web graph and social network analysis, and computational science. However, MapReduce systems lack a feature that has been key to the historical success of database systems, namely, cost-based optimization. A major challenge here is that, to the MapReduce system, a program consists of black-box map and reduce functions written in some programming language like C++, Java, Python, or Ruby. We introduce, to our knowledge, the first Cost-based Optimizer for simple to arbitrarily complex MapReduce programs. We focus on the optimization opportunities presented by the large space of configuration parameters for these programs. We also introduce a Profiler to collect detailed statistical information from unmodified MapReduce programs, and a What-if Engine for fine-grained cost estimation. All components have been prototyped for the popular Hadoop MapReduce system. The effectiveness of each component is demonstrated through a comprehensive evaluation using representative MapReduce programs from various application domains.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
White, T. (2009) · Cited by 2,800
HadoopDB: an architectural hybrid of MapReduce and DBMS technologies for analytical workloads
Abouzeid, A., Bajda-Pawlikowski, K., Abadi, D., Silberschatz, A., & Rasin, A. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687731 · Cited by 857
HaLoop: efficient iterative data processing on large clusters
Bu, Y., Howe, B., Balazinska, M., & Ernst, M. D. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920881 · Cited by 693
Starfish: A Self-tuning System for Big Data Analytics.
Herodotou, H., Lim, H., Luo, G., Borisov, N., Dong, L., Cetin, F. B., & Babu, S. (2011) · Cited by 587
Self-citationData-intensive text processing with MapReduce
Lin, J., & Dyer, C. (2009) · Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Tutorial Abstracts on - NAACL '09 · doi:10.3115/1620950.1620951 · Cited by 445
A comparison of join algorithms for log processing in MaPreduce
Blanas, S., Patel, J. M., Ercegovac, V., Rao, J., Shekita, E. J., & Tian, Y. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807273 · Cited by 414
The performance of MapReduce: an in-depth study
Jiang, D., Ooi, B. C., Shi, L., & Wu, S. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920903 · Cited by 392
Hadoop++: making a yellow elephant run like a cheetah (without it even noticing)
Dittrich, J., Quiané-Ruiz, J.-A., Jindal, A., Kargin, Y., Setty, V., & Schad, J. (2010) · Proceedings of the VLDB Endowment · doi:10.14778/1920841.1920908 · Cited by 364
Optimizing joins in a map-reduce environment
Afrati, F. N., & Ullman, J. D. (2010) · Proceedings of the 13th International Conference on Extending Database Technology · doi:10.1145/1739041.1739056 · Cited by 338
Cited by
Big Data computing and clouds: trends and future directions
Assunção, M. D., Calheiros, R. N., Bianchi, S., Netto, M. A. S., & Buyya, R. (2015) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2014.08.003 · Cited by 901
Interactive analytical processing in big data systems: a cross-industry study of MapReduce workloads
Chen, Y., Alspaugh, S., & Katz, R. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2367502.2367519 · Cited by 469
Efficient big data processing in Hadoop MapReduce
Dittrich, J., & Quiané-Ruiz, J.-A. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2367502.2367562 · Cited by 258
Systems Approaches to Tackling Configuration Errors: A Survey
Xu, T., & Zhou, Y. (2015) · ACM Computing Surveys · doi:10.1145/2791577 · Cited by 139
Metadata
- Authors
- Herodotou, H., & Babu, S.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2011-08
- Volume
- 4
- Issue
- 11
- Pages
- 1111-1122
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2294316975
- Cited by
- 368
- References
- 14
- FWCI
- 118.37
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Profiling, what-if analysis, and cost-based optimization of MapReduce programs. https://app.cochat.ai/papers/10.14778/3402707.3402746
- The paper
- Herodotou, H., & Babu, S. (2011). Profiling, what-if analysis, and cost-based optimization of MapReduce programs. Proceedings of the VLDB Endowment. https://doi.org/10.14778/3402707.3402746
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.