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

Authors

394

  1. PS
    Philip S. Yu

    University of Illinois Chicago, United States

    9 publications · 376 citations

    9

    h-index

  2. DJ
    David J. DeWitt

    University of Wisconsin–Madison, United States

    8 publications · 1.8K citations

    8

    h-index

  3. DD
    D.M. Dias

    IBM Research - Thomas J. Watson Research Center, United States

    7 publications · 298 citations

    7

    h-index

  4. JF
    Jeffrey F. Naughton

    University of Wisconsin–Madison, United States

    6 publications · 580 citations

    6

    h-index

  5. DA
    Donovan A. Schneider

    University of Wisconsin–Madison, United States

    6 publications · 1.6K citations

    6

    h-index

1–5 of 394

Venues

  1. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 11 publications · 1K citations

    11

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 9 publications · 214 citations

    9

    h-index

  3. Proceedings of the VLDB Endowment

    PVLDB · 6 publications · 602 citations

    6

    h-index

  4. Very Large Data Bases

    Conference · 5 publications · 473 citations

    5

    h-index

  5. ACM Transactions on Database Systems

    TODS · 4 publications · 179 citations

    4

    h-index

1–5