Efficient Subgraph Matching on Billion Node Graphs
Summary: Subgraph matching on billion-node graphs with a distributed-memory store. A novel algorithm avoids super-linear indices, relying on efficient graph exploration and massive parallelism for scalable query processing; experiments demonstrate web-scale feasibility. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zhao Sun
- 2. Hongzhi Wang
- 3. Haixun Wang
- 4. Bin Shao
- 5. Jianzhong Li
Incoming Citations (Sorted by Pagerank)
Showing 7 of 57 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,270 | Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration | 2026 | VLDB | 4.1905499e-05 |
| 10,523 | cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns | 2025 | SIGMOD | 4.1905499e-05 |
| 10,740 | Subgraph Matching: A New Decomposition Based Approach | 2025 | VLDB | 4.1905499e-05 |
| 10,855 | Mix & Match: Subgraph Matching for Absolute Coverage | 2025 | VLDB | 4.1905499e-05 |
| 10,951 | gSWORD: GPU-accelerated Sampling for Subgraph Counting | 2024 | SIGMOD | 4.1905499e-05 |
| 11,563 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD | 4.1905499e-05 |
| 11,574 | Towards the Scheduling of Vertex-constrained Multi Subgraph Matching Query | 2020 | SIGMOD | 4.1905499e-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 |
|---|---|---|---|---|
| 4 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0019040811 |
| 460 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD | 0.00022679846 |
| 502 | On Graph Query Optimization in Large Networks | 2010 | VLDB | 0.00021528261 |
| 576 | Substructure Similarity Search in Graph Databases | 2005 | SIGMOD | 0.00019858777 |
| 916 | Distance-Join: Pattern Match Query In a Large Graph Database | 2009 | VLDB | 0.00015326675 |
| 1,068 | Probase: A Probabilistic Taxonomy for Text Understanding | 2012 | SIGMOD | 0.00014316508 |
| 1,444 | SAPPER: Subgraph Indexing and Approximate Matching in Large Graphs | 2010 | VLDB | 0.00011941836 |
| 3,873 | Efficient Subgraph Similarity Search on Large Probabilistic Graph Databases | 2012 | VLDB | 6.673504e-05 |
| 4,321 | Mining Top-K Large Structural Patterns in a Massive Network | 2011 | VLDB | 6.2821897e-05 |
| 4,959 | Efficient Subgraph Search over Large Uncertain Graphs | 2011 | VLDB | 5.7992713e-05 |
Previous
Page 1 / 1
Next