Parallel Join Algorithms
Parallel Join Algorithms is a class of distributed query processing methods that belong to the broader category of join algorithms in database systems, distinguished by their design to partition, distribute, and concurrently execute join operations across multiple processing nodes to enhance performance through parallelism.
164
Publications
9.4K
Citations
394
Authors
158
Institutions
Publications per year
2017–2026
28
Parents
164
Efficient parallel set-similarity joins using MapReduce
Rares Vernica, Michael J. Carey, Chen Li · 2010 · 456 citations
A comparison of join algorithms for log processing in MaPreduce
Spyros Blanas, Jignesh M. Patel, Vuk Ercegovac et al. · 2010 · 411 citations
Relational joins on graphics processors
Bingsheng He, Ke Yang, Rui Fang et al. · 2008 · 352 citations
1–5 of 164
394
9
h-index
8
h-index
IBM Research - Thomas J. Watson Research Center, United States
7 publications · 298 citations
7
h-index
6
h-index
6
h-index
1–5 of 394
158
University of Wisconsin–Madison
Madison, United States
14 h-index
32 publications
7.2K citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
11 h-index
31 publications
1.3K citations
IBM (United States)
Armonk, United States
8 h-index
24 publications
893 citations
Columbia University
New York, United States
5 h-index
13 publications
814 citations
IBM Research - Almaden
San Jose, United States
5 h-index
12 publications
1.8K citations
TU Dortmund University
Dortmund, Germany
5 h-index
7 publications
394 citations
Stanford University
Stanford, United States
4 h-index
12 publications
1.5K citations
University of Michigan
Ann Arbor, United States
4 h-index
7 publications
171 citations
1–8 of 158
TKDE · 11 publications · 1K citations
11
h-index
TPDS · 9 publications · 214 citations
9
h-index
PVLDB · 6 publications · 602 citations
6
h-index
Conference · 5 publications · 473 citations
5
h-index
TODS · 4 publications · 179 citations
4
h-index
1–5