Database Paper Browser

Back to papers

Dynamic Scaling for Parallel Graph Computations

Summary: Dynamic scaling for vertex-partitioned graphs; balancing load, replication, and migration when scaling by k is intractable even for constant k. Proposes two parallel solutions: (i) extended consistent-hashing approximations with provable replication/migration bounds; (ii) a generic adaptive scaling scheme with VP-relative guarantees. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12012
Venue
VLDB
Year
2019
Pagerank
4.1945683e-05
Overall Rank
11,697 | 18.63%
DOI
10.14778/3324301.3324305

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

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

Rank Cited Paper Year Venue Pagerank
444 Parallelizing Sequential Graph Computations 2017 SIGMOD 0.00022987918
664 Relational Cloud: A Database-as-a-Service for the Cloud 2011 CIDR 0.00018465843
2,595 LEOPARD: Lightweight Edge-Oriented Partitioning and Replication for Dynamic Graphs 2016 VLDB 8.4735292e-05
3,180 Energy Management for MapReduce Clusters 2010 VLDB 7.4302009e-05
3,573 A Scalable Distributed Graph Partitioner 2015 VLDB 6.954939e-05
4,473 LogGP: A Log-based Dynamic Graph Partitioning Method 2014 VLDB 6.1542362e-05
Previous Page 1 / 1 Next

Semantically Similar Papers