Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner
Summary: Social Hash Partitioner: scalable distributed hypergraph partitioner minimizing fanout with a probabilistic objective, enabling a simple local search. Handles billions of vertices/edges in hours, scales with machine count, and outperforms rivals by ~100x on the same hardware; open-source recursive-bisection. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Igor Kabiljo
- 2. Brian Karrer
- 3. Mayank Pundir
- 4. Sergey Pupyrev
- 5. Alon Shalita
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,236 | Distributed Edge Partitioning for Trillion-edge Graphs | 2019 | VLDB | 6.3296839e-05 |
| 4,499 | Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent | 2019 | VLDB | 6.132875e-05 |
| 5,599 | Neighborhood-based Hypergraph Core Decomposition | 2023 | VLDB | 5.4164926e-05 |
| 9,134 | Cache-aware load balancing of data center applications | 2019 | VLDB | 4.384961e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 208 | Schism: a Workload-Driven Approach to Database Replication and Partitioning | 2010 | VLDB | 0.00034478612 |
Previous
Page 1 / 1
Next