Implementing and optimizing multiple group by query in a MapReduce approach

DOI10.1260/1748-3018.4.2.183MaRDI QIDQ3589426zbMATH OpenOpenAlexFDO

Authors Jie Pan, Frédéric Magoulès, Yann le Biannic

Publication date 20 September 2010

Published in Journal of Algorithms & Computational Technology (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.1260/1748-3018.4.2.183

zbMATH Keywords

aggregationcommunication costgrid computing

Mathematics Subject Classification ID

Internet topics (68M11) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Google's MapReduce programming model - Revisited
• Sharing across multiple MapReduce jobs
• Sorting algorithm analysis of distributed data based on Map/Reduce
• Sorting, searching, and simulation in the MapReduce framework
• Languages and Compilers for Parallel Computing

Cited in

(6)

• MapReduce
• Efficient ELM-based two stages query processing optimization for big data
• Google's MapReduce programming model - Revisited
• Sharing across multiple MapReduce jobs
• Sorting algorithm analysis of distributed data based on Map/Reduce
• Hash partitioning optimizations based on MapReduce for chip multiprocessors

This page was built for publication: Implementing and optimizing multiple group by query in a MapReduce approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3589426)