DBScholar

Back to papers

TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data

Summary: TurboFlux enables fast continuous subgraph matching on streaming dynamic graphs via incremental maintenance and a compact intermediate-result representation. Handles edge updates with low overhead, yielding vast throughput gains over prior systems. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hb4ca35808b37bb80
Venue
SIGMOD
Year
2018
Pagerank
8.7971869e-05
Overall Rank
2,226 | 85.09%
DOI
10.1145/3183713.3196917

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{kim_sigmod18,
        title = {{TurboFlux: A Fast Continuous Subgraph Matching System for Streaming Graph Data}},
        author = {Kim, Kyongmin and Seo, In and Han, Wook-Shin and Lee, Jeong-Hoon and Hong, Sungpack and Chafi, Hassan and Shin, Hyungyu and Jeong, Geonhwa},
        series = {{SIGMOD} '18},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3183713.3196917},
        url = {https://dl.acm.org/doi/10.1145/3183713.3196917},
        year = {2018}
}

Incoming Citations (Sorted by Pagerank)

Showing 27 of 27 citing papers.

Rank Citing Paper Year Venue Pagerank
952 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012878316
1,090 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012062682
1,907 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.379165e-05
2,480 Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU 2020 VLDB 8.387452e-05
3,020 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7267183e-05
4,099 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.7940875e-05
4,485 Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction 2023 SIGMOD 6.5644966e-05
4,801 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.3940913e-05
5,224 Efficient Streaming Subgraph Isomorphism with Graph Neural Networks 2021 VLDB 6.2100595e-05
5,404 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.132986e-05
5,995 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.903845e-05
6,061 PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration 2021 SIGMOD 5.8831543e-05
6,251 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.8179719e-05
7,502 Extending Graph Patterns with Conditions 2020 SIGMOD 5.4943054e-05
8,236 LM-SRPQ: Efficiently Answering Regular Path Query in Streaming Graphs 2024 VLDB 5.3569644e-05
9,059 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.21427e-05
9,179 In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework 2024 SIGMOD 5.1992749e-05
9,525 PG-Triggers: Triggers for Property Graphs 2024 SIGMOD 5.151324e-05
10,101 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.068372e-05
10,145 View-based Explanations for Graph Neural Networks 2024 SIGMOD 5.0597449e-05
10,196 Automating Incremental Graph Processing with Flexible Memoization 2021 VLDB 5.0514463e-05
10,289 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.031399e-05
10,630 Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings 2026 SIGMOD 4.9605343e-05
10,689 An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] 2026 SIGMOD 4.9605343e-05
10,811 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.9605343e-05
11,059 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 4.9605343e-05
11,243 AJOSC: Adaptive Join Order Selection for Continuous Queries 2025 SIGMOD 4.9605343e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 19 of 19 cited papers.

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

Rank Cited Paper Year Venue Pagerank
19 A Critique of ANSI SQL Isolation Levels 1995 SIGMOD 0.00058631912
208 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024929198
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022009138
356 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020086045
439 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018247958
485 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017479773
658 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015032442
959 RDF-3X: a RISC-style Engine for RDF 2008 VLDB 0.00012825889
1,049 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012293903
1,180 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.00011600363
1,323 Incremental Graph Pattern Matching 2011 SIGMOD 0.00011019578
1,417 A Distributed Graph Engine for Web Scale RDF Data 2013 VLDB 0.00010706533
1,502 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010431532
1,813 gStore: Answering SPARQL Queries via Subgraph Matching 2011 VLDB 9.5705978e-05
2,636 Hybrid Garbage Collection for Multi-Version Concurrency Control in SAP HANA 2016 SIGMOD 8.176465e-05
4,568 Querying Big Graphs within Bounded Resources 2014 SIGMOD 6.5171208e-05
4,601 Event Pattern Matching over Graph Streams 2015 VLDB 6.4964963e-05
4,835 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.3793473e-05
6,210 StreamWorks - A system for Dynamic Graph Search 2013 SIGMOD 5.8317155e-05
Previous Page 1 / 1 Next

Semantically Similar Papers