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: h81b97f9b9e709737
Venue: VLDB
Year: 2016
Pagerank: 8.5510365e-05
Overall Rank: 2,377 | 84.02%
DOI: 10.14778/2904483.2904486

Incoming Non-self Citations Over Time

Authors

1. Jiewen Huang (Yale University)
2. Daniel J. Abadi (Yale University)

BibTeX Citation

@article{huang_vldb16,
        title = {{LEOPARD: Lightweight Edge-Oriented Partitioning and Replication for Dynamic Graphs}},
        author = {Huang, Jiewen and Abadi, Daniel J.},
        journal = {PVLDB},
        series = {{VLDB} '16},
        volume = {9},
        number = {7},
        doi = {10.14778/2904483.2904486},
        url = {https://doi.org/10.14778/2904483.2904486},
        year = {2016}
}

Incoming Citations (Sorted by Pagerank)

Showing 13 of 13 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
3,390	Experimental Analysis of Streaming Algorithms for Graph Partitioning	2019	SIGMOD	7.3509644e-05
3,668	TopoX: Topology Refactorization for Efficient Graph Partitioning and Processing	2019	VLDB	7.1131403e-05
3,830	Distributed Edge Partitioning for Trillion-edge Graphs	2019	VLDB	6.9966388e-05
4,435	Adaptive Concurrency Control: Despite the Looking Glass, One Concurrency Control Does Not Fit All	2017	CIDR	6.6007678e-05
4,455	Application Driven Graph Partitioning	2020	SIGMOD	6.5921511e-05
5,926	Incrementalization of Graph Partitioning Algorithms	2020	VLDB	5.9443878e-05
8,787	CUTTANA: Scalable Graph Partitioning for Faster Distributed Graph Databases and Analytics	2025	VLDB	5.276816e-05
10,272	TuskFlow: An Efficient Graph Database for Long-Running Transactions	2025	VLDB	5.0485061e-05
11,300	Triparts: Scalable Streaming Graph Partitioning to Enhance Community Structure	2025	VLDB	4.9793485e-05
11,571	FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition	2024	VLDB	4.9793485e-05
12,146	Helios: An Adaptive and Query Workload-driven Partitioning Framework for Distributed Graph Stores	2019	SIGMOD	4.9793485e-05
12,185	Integration of Large-Scale Data Processing Systems and Traditional Parallel Database Technology	2019	VLDB	4.9793485e-05
12,192	Dynamic Scaling for Parallel Graph Computations	2019	VLDB	4.9793485e-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
3	Pregel: A System for Large-Scale Graph Processing	2010	SIGMOD	0.0012092602
12	C-Store: A Column-oriented DBMS	2005	VLDB	0.00068998927
123	Schism: a Workload-Driven Approach to Database Replication and Partitioning	2010	VLDB	0.00030762995
444	Trinity: A Distributed Graph Engine on a Memory Cloud	2013	SIGMOD	0.00018177351
511	Scalable SPARQL Querying of Large RDF Graphs	2011	VLDB	0.00017061883
3,154	Managing Large Dynamic Graphs Efficiently	2012	SIGMOD	7.5870734e-05
4,542	LogGP: A Log-based Dynamic Graph Partitioning Method	2014	VLDB	6.5482322e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	12,192	Dynamic Scaling for Parallel Graph Computations	2019	VLDB
2	3,390	Experimental Analysis of Streaming Algorithms for Graph Partitioning	2019	SIGMOD
3	4,800	Multi-Dimensional Balanced Graph Partitioning via Projected Gradient Descent	2019	VLDB
4	5,926	Incrementalization of Graph Partitioning Algorithms	2020	VLDB
5	11,571	FSM: A Fine-grained Splitting and Merging Framework for Dual-balanced Graph Partition	2024	VLDB
6	4,542	LogGP: A Log-based Dynamic Graph Partitioning Method	2014	VLDB
7	3,830	Distributed Edge Partitioning for Trillion-edge Graphs	2019	VLDB
8	4,455	Application Driven Graph Partitioning	2020	SIGMOD
9	3,286	A Scalable Distributed Graph Partitioner	2015	VLDB
10	5,730	Hybrid Edge Partitioner: Partitioning Large Power-Law Graphs under Memory Constraints	2021	SIGMOD