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
Parents
34
Igor Kabiljo, Brian Karrer, Mayank Pundir et al. · Proceedings of the VLDB Endowment · 2017 · 54 citations
1–5 of 34
107
3
h-index
IBM Research - Thomas J. Watson Research Center, United States
2 publications · 118 citations
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 107
46
IBM (United States)
Armonk, United States
4 h-index
11 publications
519 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
3 h-index
9 publications
445 citations
Bell (Canada)
Montreal, Canada
2 h-index
6 publications
270 citations

University of Ioannina
Ioannina, Greece
2 h-index
3 publications
89 citations

King Abdullah University of Science and Technology
Jeddah, Saudi Arabia
1 h-index
3 publications
135 citations
National University of Computer and Emerging Sciences
Islamabad, Pakistan
1 h-index
2 publications
52 citations
Université Savoie Mont Blanc
Chambéry, France
1 h-index
1 publications
17 citations
Massachusetts Institute of Technology
Cambridge, United States
1 h-index
3 publications
78 citations
1–8 of 46
PVLDB · 3 publications · 242 citations
3
h-index
Conference · 2 publications · 81 citations
2
h-index
TON · 2 publications · 60 citations
2
h-index
TODS · 1 publications · 19 citations
1
h-index
Repository · 1 publications · 23 citations
1
h-index
1–5