Distance-Join: Pattern Match Query In a Large Graph Database
Summary: Distance-Join transforms graph vertices into vectors, turning pattern-match queries on large graphs into a distance-based multi-way join in vector space. It introduces pruning strategies and join-order optimization, with experiments showing orders-of-magnitude speedups over existing methods. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Lei Zou
- 2. Lei Chen
- 3. M. Tamer Özsu
Incoming Citations (Sorted by Pagerank)
Showing 24 of 24 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 148 | Efficient Processing of Spatial Joins Using R-trees | 1993 | SIGMOD | 0.00041182766 |
| 171 | Algorithmics and Applications of Tree and Graph Searching | 2002 | PODS | 0.00038830709 |
| 203 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD | 0.00034889335 |
| 334 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD | 0.00027081079 |
| 350 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD | 0.00026365067 |
| 900 | Graph Indexing: Tree + Delta >= Graph | 2007 | VLDB | 0.00015495155 |
| 2,281 | Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data | 2001 | SIGMOD | 9.1077704e-05 |
| 4,143 | Efficient Algorithms for Exact Ranked Twig-Pattern Matching over Graphs | 2008 | SIGMOD | 6.4129418e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 461 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD | 0.00022499343 |
| 1,635 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB | 0.0001105793 |
| 3,036 | RapidMatch: A Holistic Approach to Subgraph Query Processing | 2021 | VLDB | 7.6735171e-05 |
| 11,961 | Leveraging Graph Dimensions in Online Graph Search | 2015 | VLDB | 4.1945683e-05 |
| 1,414 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB | 0.00012118275 |
| 10,733 | Subgraph Matching: A New Decomposition Based Approach | 2025 | VLDB | 4.1945683e-05 |
| 1,180 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD | 0.00013456907 |
| 11,565 | Simulation-based Approximate Graph Pattern Matching | 2020 | SIGMOD | 4.1945683e-05 |
| 651 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB | 0.00018648572 |
| 11,559 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD | 4.1945683e-05 |