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
- 2. Jeffrey Xu Yu
- 3. Can Lu
- 4. Xuemin Lin
Incoming Citations (Sorted by Pagerank)
Showing 22 of 22 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 |
|---|---|---|---|---|
| 103 | Making B+-Trees Cache Conscious in Main Memory | 2000 | SIGMOD | 0.00049150032 |
| 124 | DBMSs On A Modern Processor: Where Does Time Go? | 1999 | VLDB | 0.00045103515 |
| 238 | Cache Conscious Indexing for Decision-Support in Main Memory | 1999 | VLDB | 0.00031642425 |
| 531 | Improving Index Performance through Prefetching | 2001 | SIGMOD | 0.00020790058 |
| 574 | From "Think Like a Vertex" to "Think Like a Graph" | 2014 | VLDB | 0.00019883211 |
| 1,171 | Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs | 2014 | VLDB | 0.00013511313 |
| 1,665 | The More the Merrier: Efficient Multi-Source Graph Traversal | 2015 | VLDB | 0.00010967716 |
| 1,685 | Fast Iterative Graph Computation with Block Updates | 2013 | VLDB | 0.0001091808 |
| 3,623 | Cache-conscious Frequent Pattern Mining on a Modern Processor | 2005 | VLDB | 6.9062146e-05 |
| 6,207 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1572428e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,194 | On the Complexity of Approximate Query Optimization | 2002 | PODS | 6.3697822e-05 |
| 1,685 | Fast Iterative Graph Computation with Block Updates | 2013 | VLDB | 0.0001091808 |
| 10,985 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1945683e-05 |
| 7,166 | Ranked Enumeration of Join Queries with Projections | 2022 | VLDB | 4.8124491e-05 |
| 9,464 | Memory Efficient Scheduling of Query Pipeline Execution | 2022 | CIDR | 4.3355852e-05 |
| 8,164 | Efficiently Computing Join Orders with Heuristic Search | 2023 | SIGMOD | 4.5718104e-05 |
| 10,642 | Locality-Aware Cache Replacement Policy for Graph Traversals | 2025 | VLDB | 4.1945683e-05 |
| 12,041 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD | 4.1945683e-05 |
| 10,131 | A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] | 2026 | SIGMOD | 4.1945683e-05 |
| 4,494 | Multi-Query Optimization for Subgraph Isomorphism Search | 2017 | VLDB | 6.1414196e-05 |