Speedup Graph Processing by Graph Ordering

Summary: Graph ordering to speed up graph processing by minimizing cache misses, without altering algorithms. NP-hard; bounded-approximation algorithm and a faster variant with a data structure; experiments vs METIS on 8 graphs and 9 algorithms show cache-miss reductions. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 5309
Venue: SIGMOD
Year: 2016
Pagerank: 0.00010538011
Overall Rank: 1,511 | 89.64%
DOI: 10.1145/2882903.2915220

Incoming Non-self Citations Over Time

Authors

1. Hao Wei (Chinese University of Hong Kong)
2. Jeffrey Xu Yu (Chinese University of Hong Kong)
3. Can Lu (Chinese University of Hong Kong)
4. Xuemin Lin (University of New South Wales)

BibTeX Citation

@inproceedings{wei_sigmod16,
        title = {{Speedup Graph Processing by Graph Ordering}},
        author = {Wei, Hao and Yu, Jeffrey Xu and Lu, Can and Lin, Xuemin},
        series = {{SIGMOD} '16},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/2882903.2915220},
        url = {https://dl.acm.org/doi/10.1145/2882903.2915220},
        year = {2016}
}

Incoming Citations (Sorted by Pagerank)

Showing 24 of 24 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
1,211	Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks	2019	VLDB	0.00011648789
1,760	Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment	2024	SIGMOD	9.8157819e-05
2,060	Traversing Large Graphs on GPUs with Unified Memory	2020	VLDB	9.2454783e-05
2,112	Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions	2018	SIGMOD	9.1514258e-05
3,778	Terrace: A Hierarchical Graph Container for Skewed Dynamic Graphs	2021	SIGMOD	7.1334329e-05
3,821	Distributed Subgraph Matching on Timely Dataflow	2019	VLDB	7.0933895e-05
4,157	GPU-based Graph Traversal on Compressed Graphs	2019	SIGMOD	6.8629037e-05
5,075	CGgraph: An Ultra-fast Graph Processing System on Modern Commodity CPU-GPU Co-processor	2024	VLDB	6.3740128e-05
5,581	Subgraph Matching over Graph Federation	2022	VLDB	6.1624715e-05
5,612	Cache-Efficient Fork-Processing Patterns on Large Graphs	2021	SIGMOD	6.1501992e-05
6,440	DiskGNN: Bridging I/O Efficiency and Model Accuracy for Out-of-Core GNN Training	2025	SIGMOD	5.8782861e-05
7,491	Self-adaptive Graph Traversal on GPUs	2021	SIGMOD	5.6059269e-05
7,624	RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs	2021	VLDB	5.5805027e-05
9,003	Planting Trees for scalable and efficient Canonical Hub Labeling	2020	VLDB	5.3345443e-05
9,281	Sage: A System for Uncertain Network Analysis	2022	VLDB	5.2933125e-05
10,207	Bw-Graph: An Efficient Graph Storage System Harmonizing Topology-Aware Tree with Paged CSR	2026	SIGMOD	5.093636e-05
10,236	FaaSBoard: Efficient Graph Processing with a Disaggregated Architecture on Serverless Services	2026	SIGMOD	5.093636e-05
10,359	DiskJoin: Large-scale Vector Similarity Join with SSD	2026	SIGMOD	5.093636e-05
10,376	GraphTwin: Cache-Centric Bit-Level Graph Representation for Fast and Exact Graph Queries	2026	SIGMOD	5.093636e-05
10,400	Scalable Graph Indexing using GPUs for Approximate Nearest Neighbor Search	2026	SIGMOD	5.093636e-05
10,753	Clementi: Efficient Load Balancing and Communication Overlap for Multi-FPGA Graph Processing	2025	SIGMOD	5.093636e-05
10,894	Locality-Aware Cache Replacement Policy for Graph Traversals	2025	VLDB	5.093636e-05
10,899	Can Graph Reordering Speed Up Graph Neural Network Training? An Experimental Study	2025	VLDB	5.093636e-05
11,087	Towards Sufficient GPU-accelerated Dynamic Graph Management: Survey and Experiment	2025	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
67	Making B+-Trees Cache Conscious in Main Memory	2000	SIGMOD	0.00038461275
109	DBMSs On A Modern Processor: Where Does Time Go?	1999	VLDB	0.000331207
204	Cache Conscious Indexing for Decision-Support in Main Memory	1999	VLDB	0.00025342994
487	From "Think Like a Vertex" to "Think Like a Graph"	2014	VLDB	0.00017645653
545	Improving Index Performance through Prefetching	2001	SIGMOD	0.00016766463
937	Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs	2014	VLDB	0.00013091546
1,432	The More the Merrier: Efficient Multi-Source Graph Traversal	2015	VLDB	0.0001080346
1,911	Fast Iterative Graph Computation with Block Updates	2013	VLDB	9.4965133e-05
3,969	Cache-conscious Frequent Pattern Mining on a Modern Processor	2005	VLDB	6.9837297e-05
5,540	Efficiently Computing k-Edge Connected Components via Graph Decomposition	2013	SIGMOD	6.1809407e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,553	On the Complexity of Approximate Query Optimization	2002	PODS
2	1,911	Fast Iterative Graph Computation with Block Updates	2013	VLDB
3	11,198	Constant-time Connectivity Querying in Dynamic Graphs	2024	SIGMOD
4	6,412	Ranked Enumeration of Join Queries with Projections	2022	VLDB
5	9,612	Memory Efficient Scheduling of Query Pipeline Execution	2022	CIDR
6	7,882	Efficiently Computing Join Orders with Heuristic Search	2023	SIGMOD
7	10,894	Locality-Aware Cache Replacement Policy for Graph Traversals	2025	VLDB
8	12,239	I/O Efficient: Computing SCCs in Massive Graphs	2013	SIGMOD
9	10,419	A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis]	2026	SIGMOD
10	3,709	Multi-Query Optimization for Subgraph Isomorphism Search	2017	VLDB