Strongly minimal MapReduce algorithms: a terasort case study

DOI10.1007/978-3-030-39951-1_18OpenAlexW3003540023MaRDI QIDQ2206789

Yanyan Li

Publication date: 26 October 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-39951-1_18

zbMATH Keywords

distributed sortingminimal MapReduce algorithmssample-partition problem

Mathematics Subject Classification ID

Database theory (68P15) Logic in artificial intelligence (68T27) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Related Items (2)

Range partitioning within sublinear time: algorithms and lower bounds ⋮ Lessons from the Congested Clique Applied to MapReduce

This page was built for publication: Strongly minimal MapReduce algorithms: a terasort case study

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