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)
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 25 of 25 citing papers.
Previous
Page 1 / 1
Next
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 |
|---|---|---|---|---|
| 68 | Making B+-Trees Cache Conscious in Main Memory | 2000 | SIGMOD | 0.00037957995 |
| 110 | DBMSs On A Modern Processor: Where Does Time Go? | 1999 | VLDB | 0.00032696785 |
| 206 | Cache Conscious Indexing for Decision-Support in Main Memory | 1999 | VLDB | 0.00024981343 |
| 497 | From "Think Like a Vertex" to "Think Like a Graph" | 2014 | VLDB | 0.00017315387 |
| 547 | Improving Index Performance through Prefetching | 2001 | SIGMOD | 0.00016575635 |
| 959 | Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs | 2014 | VLDB | 0.00012849025 |
| 1,443 | The More the Merrier: Efficient Multi-Source Graph Traversal | 2015 | VLDB | 0.00010634797 |
| 1,964 | Fast Iterative Graph Computation with Block Updates | 2013 | VLDB | 9.302712e-05 |
| 4,026 | Cache-conscious Frequent Pattern Mining on a Modern Processor | 2005 | VLDB | 6.8430008e-05 |
| 5,664 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 6.0444315e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,568 | On the Complexity of Approximate Query Optimization | 2002 | PODS |
| 2 | 1,964 | Fast Iterative Graph Computation with Block Updates | 2013 | VLDB |
| 3 | 11,546 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 4 | 6,547 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB |
| 5 | 9,790 | Memory Efficient Scheduling of Query Pipeline Execution | 2022 | CIDR |
| 6 | 8,046 | Efficiently Computing Join Orders with Heuristic Search | 2023 | SIGMOD |
| 7 | 11,300 | Locality-Aware Cache Replacement Policy for Graph Traversals | 2025 | VLDB |
| 8 | 12,536 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD |
| 9 | 10,260 | A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] | 2026 | SIGMOD |
| 10 | 3,769 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB |