2013/04/29 by Jimmy Lin, Lin, Jimmy · 1 voice
Computer Science · #Advanced Database Systems and Queries #Data Management and Algorithms #Data Mining Algorithms and Applications #Databases (cs.DB) #Distributed #FOS: Computer and information sciences #Parallel #Programming Languages (cs.PL) #and Cluster Computing (cs.DC) #cs.DB #cs.DC #cs.PL
paper · pdf · doi:10.48550/arxiv.1304.7544
arxiv created 2013/04/29 · openalex publication_date 2013/04/29 · arxiv published 2013/04/29 · arxiv updated 2013/04/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
It is well known that since the sort/shuffle stage in MapReduce is costly, local aggregation is one important principle to designing efficient algorithms. This short paper represents an attempt to more clearly articulate this design principle in terms of monoids, which generalizes the use of combiners and the in-mapper combining pattern.