DBScholar

Back to papers

Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration

Summary: Systematic empirical study of parallel subgraph matching on shared-memory multicore: disentangles task splitting, scheduling, and match enumeration. Evaluates 100 technique combinations, exposing interaction effects, scalability limits, and when sequential algorithms can be parallelized effectively. (summarized by gpt-5.4-mini on May 27 2026)

Paper ID
14495
Venue
VLDB
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,558 | 27.57%
DOI
10.14778/3801059.3801076

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{yu_vldb26,
        title = {{Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration}},
        author = {Yu, Tao and Zhang, Zhijie and Zheng, Weiguo and Yu, Jeffrey Xu and Zhou, Qiang and Hong, Chuntao},
        journal = {PVLDB},
        series = {{VLDB} '26},
        volume = {19},
        number = {7},
        pages = {1659--1673},
        doi = {10.14778/3801059.3801076},
        url = {https://doi.org/10.14778/3801059.3801076},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 47 of 47 cited papers.

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

Rank Cited Paper Year Venue Pagerank
177 Graph Indexing: A Frequent Structure-based Approach 2004 SIGMOD 0.00027100548
187 Algorithmics and Applications of Tree and Graph Searching 2002 PODS 0.00026138589
294 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022253507
326 FG-Index: Towards Verification-Free Query Processing on Graph Databases 2007 SIGMOD 0.00021152829
442 Efficient Subgraph Matching on Billion Node Graphs 2012 VLDB 0.00018398144
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017717377
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015214062
727 Graph Indexing: Tree + Delta >= Graph 2007 VLDB 0.00014565738
927 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.00013161079
1,006 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012699518
1,036 Parallel Subgraph Listing in a Large-Scale Graph 2014 SIGMOD 0.00012499878
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,296 Incremental Graph Pattern Matching 2011 SIGMOD 0.00011269684
1,487 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010615297
1,552 Scalable Subgraph Enumeration in MapReduce 2015 VLDB 0.00010379532
2,035 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.2787188e-05
2,065 Scalable Distributed Subgraph Enumeration 2017 VLDB 9.2352771e-05
2,182 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 9.010121e-05
2,187 Subgraph Matching: on Compression and Computation 2018 VLDB 8.9966682e-05
2,190 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 8.9804702e-05
2,287 TriAD: A Distributed Shared-Nothing RDF Engine based on Asynchronous Message Passing 2014 SIGMOD 8.8034872e-05
2,940 G-CARE: A Framework for Performance Benchmarking of Cardinality Estimation Techniques for Subgraph Matching 2020 SIGMOD 7.9381573e-05
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
3,431 iGraph: A Framework for Comparisons of Disk-Based Graph Indexing Techniques 2010 VLDB 7.4189541e-05
3,821 Distributed Subgraph Matching on Timely Dataflow 2019 VLDB 7.0933895e-05
4,158 HUGE: An Efficient and Scalable Subgraph Enumeration System 2021 SIGMOD 6.8628196e-05
4,563 Circinus: Fast Redundancy-Reduced Subgraph Matching 2023 SIGMOD 6.6291459e-05
4,722 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.5438628e-05
4,983 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.4127092e-05
4,995 Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction 2023 SIGMOD 6.4089186e-05
5,118 Efficient Streaming Subgraph Isomorphism with Graph Neural Networks 2021 VLDB 6.3580186e-05
5,275 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.2873652e-05
5,296 Fast and Robust Distributed Subgraph Enumeration 2019 VLDB 6.2782852e-05
5,506 Accurate and Fast Approximate Graph Pattern Mining at Scale 2025 VLDB 6.1925892e-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
9,440 In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework 2024 SIGMOD 5.2680376e-05
10,084 MAVIS: Materialized View for Subgraph Matching 2026 SIGMOD 5.1573064e-05
10,312 BEE: Towards Redundancy Reduction via Block-Separator Decomposition for Subgraph Matching 2026 SIGMOD 5.093636e-05
10,904 The LDBC Financial Benchmark: Transaction Workload 2025 VLDB 5.093636e-05
10,952 Accelerating Subgraph Matching through Fine-grained and Powerful Equivalences 2025 VLDB 5.093636e-05
Previous Page 1 / 1 Next

Semantically Similar Papers