Distributed Data Partitioning

Distributed Data Partitioning is a method in distributed memory programming that divides a large dataset into disjoint subsets allocated across multiple processing nodes, distinguished by its design to minimize inter-node communication while ensuring computational load balance and data locality.

163

Publications

5.4K

Citations

504

Authors

208

Institutions

Publications per year

2017–2026

49

Authors

504

  1. VM
    Vahab Mirrokni

    Google (United States), United States

    5 publications · 162 citations

    5

    h-index

  2. WF
    Wenfei Fan

    University of Edinburgh, United Kingdom

    3 publications · 116 citations

    3

    h-index

  3. LZ
    Lantian Zheng

    Cornell University, United States

    3 publications · 279 citations

    3

    h-index

  4. SZ
    Steve Zdancewic

    University of Pennsylvania, United States

    3 publications · 279 citations

    3

    h-index

  5. LL
    Ling Liu

    Georgia Institute of Technology, United States

    3 publications · 107 citations

    3

    h-index

1–5 of 504

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 10 publications · 371 citations

    10

    h-index

  2. arXiv (Cornell University)

    Repository · 6 publications · 194 citations

    7

    h-index

  3. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 5 publications · 176 citations

    5

    h-index

  4. Distributed and Parallel Databases

    3 publications · 61 citations

    3

    h-index

  5. Information Sciences

    2 publications · 31 citations

    2

    h-index

1–5