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
12549
Venue
VLDB
Year
2021
Pagerank
9.2787188e-05
Overall Rank
2,035 | 86.04%
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 40 of 40 citing papers.

Rank Citing Paper Year Venue Pagerank
3,102 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7568687e-05
3,194 GuP: Fast Subgraph Matching by Guard-based Pruning 2023 SIGMOD 7.6491858e-05
4,983 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.4127092e-05
5,275 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.2873652e-05
5,758 Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach 2025 SIGMOD 6.0972035e-05
5,870 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 6.061038e-05
5,938 PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration 2021 SIGMOD 6.0343238e-05
6,149 Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding 2024 VLDB 5.9581422e-05
6,393 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.8879832e-05
7,150 BSX : Subgraph Matching with Batch Backtracking Search 2025 SIGMOD 5.687428e-05
8,251 Fast Local Subgraph Counting 2024 VLDB 5.4574671e-05
8,478 T-FSM: A Task-Based System for Massively Parallel Frequent Subgraph Pattern Mining from a Big Graph 2023 SIGMOD 5.4170414e-05
8,871 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.35418e-05
9,383 S^3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics 2025 VLDB 5.2755515e-05
9,440 In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework 2024 SIGMOD 5.2680376e-05
9,532 Banyan: A Scoped Dataflow Engine for Graph Query Service 2022 VLDB 5.2537948e-05
9,617 NeuSO: Neural Optimizer for Subgraph Queries 2026 SIGMOD 5.2434488e-05
9,693 Subgraph Matching: A New Decomposition Based Approach 2025 VLDB 5.2351259e-05
9,872 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.2043672e-05
10,060 TenGraph: A Tensor-Based Graph Query Engine 2024 VLDB 5.166346e-05
10,084 MAVIS: Materialized View for Subgraph Matching 2026 SIGMOD 5.1573064e-05
10,204 Beyond Maximum Common Subgraph: A Framework Maximizing Shared Computation for Multi-Query Subgraph Matching 2026 SIGMOD 5.093636e-05
10,229 Efficient Meta-subgraph Instance Search over Large Heterogeneous Information Networks 2026 SIGMOD 5.093636e-05
10,294 Sublime: Selecting Subgraph Matching Algorithms via Machine Learning 2026 SIGMOD 5.093636e-05
10,312 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.093636e-05
10,375 GraphMatch: Subgraph Query Processing on Steroids 2026 SIGMOD 5.093636e-05
10,419 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,452 Enumerating Graph Pattern Matches with ML Oracles 2026 SIGMOD 5.093636e-05
10,524 A Semantics-aware Approach for Graph Edit Distance Estimation over Knowledge Graphs 2026 VLDB 5.093636e-05
10,552 CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination 2026 VLDB 5.093636e-05
10,558 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 5.093636e-05
10,564 gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs 2026 VLDB 5.093636e-05
10,590 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 5.093636e-05
10,787 cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns 2025 SIGMOD 5.093636e-05
10,885 Efficient and Accurate Subgraph Counting: A Bottom-up Flow-learning Based Approach 2025 VLDB 5.093636e-05
10,952 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.093636e-05
11,072 Efficient Top-k Frequent Subgraph Mining Using Tight Upper and Lower Bounds 2025 VLDB 5.093636e-05
11,074 Mayura: Exploiting Similarities in Motifs for Temporal Co-Mining 2025 VLDB 5.093636e-05
11,075 Mix & Match: Subgraph Matching for Absolute Coverage 2025 VLDB 5.093636e-05
11,502 Density Personalized Group Query 2023 VLDB 5.093636e-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
189 Querying K-Truss Community in Large and Dynamic Graphs 2014 SIGMOD 0.00026114928
211 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024797217
264 The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing 2018 VLDB 0.00022980015
294 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022253507
321 Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems 2018 PODS 0.00021283186
352 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020375193
431 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018577017
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017717377
490 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.000175757
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015214062
809 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00013874588
1,006 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012699518
1,058 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012378784
1,102 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012166591
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.0001179597
1,237 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00011545768
1,246 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 0.00011504088
1,416 Local Algorithms for Hierarchical Dense Subgraph Discovery 2019 VLDB 0.00010839488
2,112 Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions 2018 SIGMOD 9.1514258e-05
2,119 DUALSIM: Parallel Subgraph Enumeration in a Massive Graph on a Single Machine 2016 SIGMOD 9.141144e-05
2,607 GPU-Accelerated Subgraph Enumeration on Partitioned Graphs 2020 SIGMOD 8.3489531e-05
2,940 G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching 2020 SIGMOD 7.9381573e-05
3,477 Performance and Scalability of Indexed Subgraph Query Processing Methods 2015 VLDB 7.3791229e-05
3,821 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 7.0933895e-05
Previous Page 1 / 1 Next

Semantically Similar Papers