Mapreduce Algorithms
MapReduce Algorithms is a distributed programming model for processing large datasets in parallel by applying a map function to partition data and a reduce function to aggregate results, distinguished by its scalability and fault tolerance in handling batch-oriented workloads across clusters.
2.4K
Publications
180.8K
Citations
6.4K
Authors
1.6K
Institutions
Publications per year
2017–2026
633
2.4K
Sanjay Ghemawat · Communications of the ACM · 2008 · 18.5K citations · Full text
Spark: cluster computing with working sets
Matei Zaharia, Mosharaf Chowdhury, Michael J. Franklin et al. · 2010 · 4.2K citations
Graph Convolutional Neural Networks for Web-Scale Recommender Systems
2018 · 2.8K citations · Full text
1–5 of 2.4K
6.4K
20
h-index
16
h-index
15
h-index
12
h-index
12
h-index
1–5 of 6.4K
1.6K
Google (United States)
Mountain View, United States
31 h-index
91 publications
27.3K citations
IBM (United States)
Armonk, United States
29 h-index
118 publications
8.1K citations
Stanford University
Stanford, United States
23 h-index
59 publications
16.8K citations
Microsoft (United States)
Redmond, United States
22 h-index
78 publications
5.8K citations

Chinese Academy of Sciences
Beijing, China
22 h-index
111 publications
4.4K citations

Universidad de Granada
Granada, Spain
20 h-index
66 publications
10.5K citations
Tsinghua University
Beijing, China
19 h-index
87 publications
3.2K citations
Indiana University Bloomington
Bloomington, United States
19 h-index
76 publications
6.2K citations
1–8 of 1.6K
PVLDB · 57 publications · 7.7K citations
43
h-index
FGCS · 36 publications · 1.7K citations
23
h-index
TPDS · 26 publications · 1.5K citations
22
h-index
24 publications · 728 citations
18
h-index
28 publications · 1.3K citations
18
h-index
1–5