DBScholar

Back to papers

An In-Depth Study of Continuous Subgraph Matching

Summary: Recasts continuous subgraph matching as incremental view maintenance and benchmarks six algorithms in a common framework. Finds no universal winner: invalid partial matches, weak ordering heuristics, and index-update costs dominate, yielding workload-specific recommendations. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
12835
Venue
VLDB
Year
2022
Pagerank
6.061038e-05
Overall Rank
5,870 | 59.73%
DOI
10.14778/3523210.3523218

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{sun_vldb22,
        title = {{An In-Depth Study of Continuous Subgraph Matching}},
        author = {Sun, Xibo and Sun, Shixuan and Luo, Qiong and He, Bingsheng},
        journal = {PVLDB},
        series = {{VLDB} '22},
        volume = {15},
        number = {7},
        pages = {1403--1416},
        doi = {10.14778/3523210.3523218},
        url = {https://doi.org/10.14778/3523210.3523218},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 29 of 29 cited papers.

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

Rank Cited Paper Year Venue Pagerank
39 Efficiently Updating Materialized Views 1986 SIGMOD 0.00047309646
61 Maintaining Views Incrementally 1993 SIGMOD 0.00039026867
211 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024797217
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
375 Incremental Maintenance of Views with Duplicates 1995 SIGMOD 0.00019681204
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
530 An Analytical Study of Large SPARQL Query Logs 2018 VLDB 0.0001709169
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
816 The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates 2017 SIGMOD 0.00013827772
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,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,103 Counting and Sampling Triangles from a Graph Stream 2013 VLDB 0.000121583
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
2,035 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 9.2787188e-05
2,148 Graph Stream Summarization: From Big Bang to Big Crunch 2016 SIGMOD 9.0825156e-05
2,182 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 9.010121e-05
2,190 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 8.9804702e-05
2,209 Regular Path Query Evaluation on Streaming Graphs 2020 SIGMOD 8.9437338e-05
2,377 gSketch: On Query Estimation in Graph Streams 2012 VLDB 8.6710302e-05
4,503 Event Pattern Matching over Graph Streams 2015 VLDB 6.6597953e-05
4,722 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.5438628e-05
Previous Page 1 / 1 Next

Semantically Similar Papers