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 (Huazhong University of Science and Technology)
- 2. Lei Chen (Hong Kong University of Science and Technology)
- 3. M. Tamer Özsu (University of Waterloo)
BibTeX Citation
@article{zou_vldb09,
title = {{Distance-Join: Pattern Match Query In a Large Graph Database}},
author = {Zou, Lei and Chen, Lei and Özsu, M. Tamer},
journal = {PVLDB},
series = {{VLDB} '09},
doi = {10.14778/1687627.1687727},
url = {https://doi.org/10.14778/1687627.1687727},
year = {2009}
}
Incoming Citations (Sorted by Pagerank)
Showing 25 of 25 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 |
|---|---|---|---|---|
| 146 | Efficient Processing of Spatial Joins Using R-trees | 1993 | SIGMOD | 0.00029061754 |
| 176 | Graph Indexing: A Frequent Structure-based Approach | 2004 | SIGMOD | 0.00026700508 |
| 192 | Algorithmics and Applications of Tree and Graph Searching | 2002 | PODS | 0.00025659453 |
| 330 | Fast and Practical Indexing and Querying of Very Large Graphs | 2007 | SIGMOD | 0.00020838159 |
| 332 | FG-Index: Towards Verification-Free Query Processing on Graph Databases | 2007 | SIGMOD | 0.00020765078 |
| 736 | Graph Indexing: Tree + Delta >= Graph | 2007 | VLDB | 0.00014363536 |
| 1,996 | Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data | 2001 | SIGMOD | 9.216723e-05 |
| 4,291 | Efficient Algorithms for Exact Ranked Twig-Pattern Matching over Graphs | 2008 | SIGMOD | 6.6827339e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 288 | Graphs-at-a-time: Query Language and Access Methods for Graph Databases | 2008 | SIGMOD |
| 2 | 1,181 | An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases | 2013 | VLDB |
| 3 | 2,014 | RapidMatch: A Holistic Approach to Subgraph Query Processing | 2021 | VLDB |
| 4 | 12,450 | Leveraging Graph Dimensions in Online Graph Search | 2015 | VLDB |
| 5 | 1,148 | Graph Pattern Matching: From Intractable to Polynomial Time | 2010 | VLDB |
| 6 | 9,361 | Subgraph Matching: A New Decomposition Based Approach | 2025 | VLDB |
| 7 | 657 | Efficient Subgraph Matching by Postponing Cartesian Products | 2016 | SIGMOD |
| 8 | 12,065 | Simulation-based Approximate Graph Pattern Matching | 2020 | SIGMOD |
| 9 | 443 | Efficient Subgraph Matching on Billion Node Graphs | 2012 | VLDB |
| 10 | 12,059 | Approximate Pattern Matching in Massive Graphs with Precision and Recall Guarantees | 2020 | SIGMOD |