Database Paper Browser

Back to papers

Application Driven Graph Partitioning

Summary: Application-driven hybrid partitioning learns a cost model for A via poly regression to refine edge-cut/vertex-cut into a hybrid partition. Identifies a condition for partition transparency; yields up to 22.5x speedups on real/synthetic graphs. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
5960
Venue
SIGMOD
Year
2020
Pagerank
5.8651797e-05
Overall Rank
4,867 | 66.15%
DOI
10.1145/3318464.3389745

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers