DBScholar

Back to papers

RapidMatch: A Holistic Approach to Subgraph Query Processing

Summary: RapidMatch: a holistic subgraph query processor that unifies exploration-based and join-based methods, bridging their regimes. Relational operators plus graph-aware filtering guide join-plan generation, delivering state-of-the-art performance across workloads and proving that exploration-based enumeration matches the worst-case optimal join. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
haeacff89a0499159
Venue
VLDB
Year
2021
Pagerank
9.1832045e-05
Overall Rank
2,014 | 86.47%
DOI
10.14778/3425879.3425888

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{sun_vldb21,
        title = {{RapidMatch: A Holistic Approach to Subgraph Query Processing}},
        author = {Sun, Shixuan and Sun, Xibo and Che, Yulin and Luo, Qiong and He, Bingsheng},
        journal = {PVLDB},
        series = {{VLDB} '21},
        volume = {14},
        number = {2},
        pages = {176--188},
        doi = {10.14778/3425879.3425888},
        url = {https://doi.org/10.14778/3425879.3425888},
        year = {2021}
}

Incoming Citations (Sorted by Pagerank)

Showing 41 of 41 citing papers.

Rank Citing Paper Year Venue Pagerank
3,011 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7549462e-05
3,164 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.5771124e-05
4,075 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.8188389e-05
5,377 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.1562325e-05
5,880 Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach 2025 SIGMOD 5.9612878e-05
5,984 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.926237e-05
6,045 PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration 2021 SIGMOD 5.9054678e-05
6,232 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.84313e-05
6,504 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.7617085e-05
6,965 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.6328006e-05
7,251 T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph 2023 SIGMOD 5.574104e-05
7,529 Fast Local Subgraph Counting 2024 VLDB 5.5009945e-05
8,891 Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds 2025 VLDB 5.2559789e-05
9,030 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.2340466e-05
9,148 In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework 2024 SIGMOD 5.2189946e-05
9,361 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.1868213e-05
9,568 S^3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics 2025 VLDB 5.1571823e-05
9,715 Banyan: A Scoped Dataflow Engine for Graph Query Service 2022 VLDB 5.1359137e-05
9,797 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.1257999e-05
10,062 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.0875952e-05
10,251 TenGraph: A Tensor-Based Graph Query Engine 2024 VLDB 5.0513876e-05
10,253 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.050482e-05
10,254 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.050482e-05
10,258 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.050482e-05
10,270 GraphMatch: Subgraph Query Processing on Steroids 2026 SIGMOD 5.0485061e-05
10,300 MAVIS: Materialized View for Subgraph Matching 2026 SIGMOD 5.0415903e-05
10,420 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 4.9793485e-05
10,445 Efficient Meta-subgraph Instance Search over Large Heterogeneous Information Networks 2026 SIGMOD 4.9793485e-05
10,506 Sublime: Selecting Subgraph Matching Algorithms via Machine Learning 2026 SIGMOD 4.9793485e-05
10,640 Enumerating Graph Pattern Matches with ML Oracles 2026 SIGMOD 4.9793485e-05
10,708 A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs 2026 VLDB 4.9793485e-05
10,734 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 4.9793485e-05
10,740 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.9793485e-05
10,746 gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs 2026 VLDB 4.9793485e-05
10,788 Subgraph Enumeration: Beyond Tree Decomposition 2026 VLDB 4.9793485e-05
10,989 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 4.9793485e-05
11,203 cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns 2025 SIGMOD 4.9793485e-05
11,286 Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach 2025 VLDB 4.9793485e-05
11,431 Mayura: Exploiting Similarities in Motifs for Temporal Co-Mining 2025 VLDB 4.9793485e-05
11,432 Mix & Match: Subgraph Matching for Absolute Coverage 2025 VLDB 4.9793485e-05
11,811 Density Personalized Group Query 2023 VLDB 4.9793485e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 24 of 24 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
184 Querying K-Truss Community in Large and Dynamic Graphs 2014 SIGMOD 0.00026100147
208 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024884544
239 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.000235107
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021969641
315 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021246
355 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020124083
438 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018286607
466 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.00017773029
490 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017438618
657 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.0001505607
712 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00014578373
960 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012836554
1,045 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012322402
1,100 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012013426
1,180 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011627669
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.00011627329
1,249 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011340141
1,443 Local Algorithms for Hierarchical Dense Subgraph Discovery 2019 VLDB 0.00010635542
2,019 Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions 2018 SIGMOD 9.1750421e-05
2,101 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.0476814e-05
2,468 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 8.4178183e-05
2,824 G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching 2020 SIGMOD 7.9698957e-05
3,506 Performance and Scalability of Indexed Subgraph Query Processing Methods 2015 VLDB 7.2501249e-05
3,880 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 6.9510799e-05
Previous Page 1 / 1 Next

Semantically Similar Papers