LEOPARD: Lightweight Edge-Oriented Partitioning and Replication for Dynamic Graphs

Summary: LEOPARD provides edge-oriented partitioning for dynamic graphs with on-the-fly rebalancing. Integrated replication reduces edge cuts and sustains near-METIS quality over time, with replication boosting edge-cut gains by an order of magnitude. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 11344
Venue: VLDB
Year: 2016
Pagerank: 8.4735292e-05
Overall Rank: 2,595 | 81.95%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Jiewen Huang
2. Daniel J. Abadi

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
3,839	Experimental Analysis of Streaming Algorithms for Graph Partitioning	2019	SIGMOD	6.7120651e-05
4,020	TopoX: Topology Refactorization for Efficient Graph Partitioning and Processing	2019	VLDB	6.5237459e-05
4,234	Distributed Edge Partitioning for Trillion-edge Graphs	2019	VLDB	6.3355073e-05
4,867	Application Driven Graph Partitioning	2020	SIGMOD	5.8651797e-05
5,227	Adaptive Concurrency Control: Despite the Looking Glass, One Concurrency Control Does Not Fit All	2017	CIDR	5.6180363e-05
6,193	Incrementalization of Graph Partitioning Algorithms	2020	VLDB	5.1632545e-05
8,900	CUTTANA: Scalable Graph Partitioning for Faster Distributed Graph Databases and Analytics	2025	VLDB	4.427232e-05
10,651	Triparts: Scalable Streaming Graph Partitioning to Enhance Community Structure	2025	VLDB	4.1945683e-05
10,763	TuskFlow: An Efficient Graph Database for Long-Running Transactions	2025	VLDB	4.1945683e-05
11,028	FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition	2024	VLDB	4.1945683e-05
11,651	Helios: An Adaptive and Query Workload-driven Partitioning Framework for Distributed Graph Stores	2019	SIGMOD	4.1945683e-05
11,690	Integration of Large-Scale Data Processing Systems and Traditional Parallel Database Technology	2019	VLDB	4.1945683e-05
11,697	Dynamic Scaling for Parallel Graph Computations	2019	VLDB	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
4	Pregel: A System for Large-Scale Graph Processing	2010	SIGMOD	0.0019005923
21	C-Store: A Column-oriented DBMS	2005	VLDB	0.00086087497
209	Schism: a Workload-Driven Approach to Database Replication and Partitioning	2010	VLDB	0.00034468292
558	Trinity: A Distributed Graph Engine on a Memory Cloud	2013	SIGMOD	0.00020168032
582	Scalable SPARQL Querying of Large RDF Graphs	2011	VLDB	0.00019723083
3,232	Managing Large Dynamic Graphs Efficiently	2012	SIGMOD	7.336861e-05
4,473	LogGP: A Log-based Dynamic Graph Partitioning Method	2014	VLDB	6.1542362e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
11,697	Dynamic Scaling for Parallel Graph Computations	2019	VLDB	4.1945683e-05
3,839	Experimental Analysis of Streaming Algorithms for Graph Partitioning	2019	SIGMOD	6.7120651e-05
4,497	Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent	2019	VLDB	6.1387773e-05
6,193	Incrementalization of Graph Partitioning Algorithms	2020	VLDB	5.1632545e-05
11,028	FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition	2024	VLDB	4.1945683e-05
4,473	LogGP: A Log-based Dynamic Graph Partitioning Method	2014	VLDB	6.1542362e-05
4,234	Distributed Edge Partitioning for Trillion-edge Graphs	2019	VLDB	6.3355073e-05
4,867	Application Driven Graph Partitioning	2020	SIGMOD	5.8651797e-05
3,573	A Scalable Distributed Graph Partitioner	2015	VLDB	6.954939e-05
5,949	Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints	2021	SIGMOD	5.2595857e-05