Database Paper Browser

Back to papers

An In-Depth Study of Continuous Subgraph Matching

Summary: Models continuous subgraph matching as incremental view maintenance; evaluates six algorithms in a framework. Experiments find no universal winner; guidance: SymBi for sparse/long queries; Graphflow for dense cases; IEDyn/TurboFlux for tree queries. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12648
Venue
VLDB
Year
2022
Pagerank
5.0780425e-05
Overall Rank
6,391 | 55.59%
DOI
10.14778/3523210.3523218

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 10 of 10 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 28 of 28 cited papers.

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

Rank Cited Paper Year Venue Pagerank
55 Efficiently Updating Materialized Views 1986 SIGMOD 0.00065687017
97 Maintaining Views Incrementally 1993 SIGMOD 0.00050863077
341 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00026850764
482 Incremental Maintenance of Views with Duplicates 1995 SIGMOD 0.00022145976
502 On Graph Query Optimization in Large Networks 2010 VLDB 0.00021528261
610 Design and Implementation of the LogicBlox System 2015 SIGMOD 0.00019204048
616 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00019068362
657 An Analytical Study of Large SPARQL Query Logs 2018 VLDB 0.00018581389
749 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017193776
1,054 The Dynamic Yannakakis Algorithm: Compact and Efficient Query Processing Under Updates 2017 SIGMOD 0.00014397587
1,125 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00013829006
1,334 Optimizing Subgraph Queries by Combining Binary and Worst-Case Optimal Joins 2019 VLDB 0.00012543633
1,348 Counting and Sampling Triangles from a Graph Stream 2013 VLDB 0.00012461666
1,392 Real-time Constrained Cycle Detection in Large Dynamic Graphs 2018 VLDB 0.00012224015
1,522 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.0001152219
1,715 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00010776518
1,746 Graphflow: An Active Graph Database 2017 SIGMOD 0.0001069135
1,806 Incremental Graph Pattern Matching 2011 SIGMOD 0.00010478244
1,906 In-Memory Subgraph Matching: An In-depth Study 2020 SIGMOD 0.00010135267
1,948 Distributed Evaluation of Subgraph Queries Using Worst-case Optimal Low-Memory Dataflows 2018 VLDB 9.9938634e-05
2,439 gSketch: On Query Estimation in Graph Streams 2012 VLDB 8.8181328e-05
2,609 Graph Stream Summarization: From Big Bang to Big Crunch 2016 SIGMOD 8.4587236e-05
2,832 Regular Path Query Evaluation on Streaming Graphs 2020 SIGMOD 8.048358e-05
2,882 TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data 2018 SIGMOD 7.9666138e-05
3,034 RapidMatch: A Holistic Approach to Subgraph Query Processing 2021 VLDB 7.6737281e-05
3,119 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 7.5393376e-05
5,017 Event Pattern Matching over Graph Streams 2015 VLDB 5.7505967e-05
5,490 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 5.4788004e-05
Previous Page 1 / 1 Next

Semantically Similar Papers