arXiv Open Access 2013

Monoidify! Monoids as a Design Principle for Efficient MapReduce Algorithms

Jimmy Lin

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.DC cs.DB cs.PL

Penulis (1)

Jimmy Lin

Format Sitasi

APA MLA BibTeX

Lin, J. (2013). Monoidify! Monoids as a Design Principle for Efficient MapReduce Algorithms. https://arxiv.org/abs/1304.7544

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2013
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓