DBScholar

Back to papers

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)

Paper ID
11614
Venue
VLDB
Year
2017
Pagerank
6.2989018e-05
Overall Rank
5,252 | 63.97%
DOI
10.14778/3137628.3137633

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{kabiljo_vldb17,
        title = {{Social Hash Partitioner: A Scalable Distributed Hypergraph Partitioner}},
        author = {Kabiljo, Igor and Karrer, Brian and Pundir, Mayank and Pupyrev, Sergey and Shalita, Alon},
        journal = {PVLDB},
        series = {{VLDB} '17},
        volume = {10},
        number = {11},
        pages = {1418--1431},
        doi = {10.14778/3137628.3137633},
        url = {https://doi.org/10.14778/3137628.3137633},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

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
126 Schism: a Workload-Driven Approach to Database Replication and Partitioning 2010 VLDB 0.00030779127
Previous Page 1 / 1 Next

Semantically Similar Papers