Distributed Join Algorithms
Distributed Join Algorithms is a class of query processing methods in distributed database systems that coordinate the execution of join operations across multiple nodes by partitioning, redistributing, and merging data to exploit parallelism and minimize communication cost.
150
Publications
6.9K
Citations
427
Authors
186
Institutions
Publications per year
2017–2026
34
Parents
150
Efficient parallel set-similarity joins using MapReduce
Rares Vernica, Michael J. Carey, Chen Li · 2010 · 456 citations
Doug Lea · 2000 · 452 citations
A comparison of join algorithms for log processing in MaPreduce
Spyros Blanas, Jignesh M. Patel, Vuk Ercegovac et al. · 2010 · 411 citations
Large-scale spatial join query processing in Cloud
Simin You, Jianting Zhang, Le Gruenwald · 2015 · 201 citations
1–5 of 150
427
4
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 427
186

UNSW Sydney
Sydney, Australia
5 h-index
18 publications
1.2K citations
University of Illinois Chicago
Chicago, United States
5 h-index
10 publications
287 citations

Centre National de la Recherche Scientifique
Paris, France
4 h-index
11 publications
294 citations

University of Toronto
Toronto, Canada
4 h-index
6 publications
198 citations
National Technical University of Athens
Athens, Greece
4 h-index
15 publications
950 citations
National University of Singapore
Singapore, Singapore
4 h-index
10 publications
484 citations

Hong Kong University of Science and Technology
Hong Kong, Hong Kong
3 h-index
4 publications
168 citations
University of Maryland, College Park
College Park, United States
3 h-index
9 publications
176 citations
1–8 of 186
PVLDB · 13 publications · 676 citations
12
h-index
TKDE · 9 publications · 347 citations
9
h-index
TSE · 4 publications · 266 citations
4
h-index
TPDS · 3 publications · 125 citations
3
h-index
TODS · 2 publications · 59 citations
2
h-index
1–5