Hash Partitioning

Hash Partitioning is a data partitioning method that assigns data elements to partitions based on the output of a hash function applied to a partitioning key, thereby ensuring uniform distribution and enabling efficient parallel processing.

34

Publications

1.1K

Citations

107

Authors

46

Institutions

Publications per year

2017–2026

12

Variants

Hash-based Partitioning

Authors

107

  1. PS
    Philip S. Yu

    University of Illinois Chicago, United States

    3 publications · 140 citations

    3

    h-index

  2. JL
    Joel L. Wolf

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

    2 publications · 118 citations

    2

    h-index

  3. GF
    Gilles Fecteau

    Université de Montréal, Canada

    2 publications · 48 citations

    2

    h-index

  4. GG
    Goetz Graefe

    Hewlett-Packard (United States), United States

    2 publications · 40 citations

    2

    h-index

  5. MK
    Murali Kodialam

    Nokia (United States), United States

    2 publications · 90 citations

    2

    h-index

1–5 of 107

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 3 publications · 242 citations

    3

    h-index

  2. Very Large Data Bases

    Conference · 2 publications · 81 citations

    2

    h-index

  3. IEEE/ACM Transactions on Networking

    TON · 2 publications · 60 citations

    2

    h-index

  4. ACM Transactions on Database Systems

    TODS · 1 publications · 19 citations

    1

    h-index

  5. arXiv (Cornell University)

    Repository · 1 publications · 23 citations

    1

    h-index

1–5