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.8237249e-05
Overall Rank
2,211 | 85.14%
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
960 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012836554
1,100 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012013426
1,900 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 9.4059063e-05
2,469 Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU 2020 VLDB 8.4165523e-05
3,011 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7549462e-05
4,075 A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction 2024 SIGMOD 6.8188389e-05
4,587 Fast Continuous Subgraph Matching over Streaming Graphs via Backtracking Reduction 2023 SIGMOD 6.5161686e-05
4,779 Symmetric Continuous Subgraph Matching with Bidirectional Dynamic Programming 2021 VLDB 6.4163774e-05
5,218 Efficient Streaming Subgraph Isomorphism with Graph Neural Networks 2021 VLDB 6.2231041e-05
5,377 RapidFlow: An Efficient Approach to Continuous Subgraph Matching 2022 VLDB 6.1562325e-05
5,984 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 5.926237e-05
6,045 PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration 2021 SIGMOD 5.9054678e-05
6,504 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.7617085e-05
7,478 Extending Graph Patterns with Conditions 2020 SIGMOD 5.5150923e-05
8,211 LM-SRPQ: Efficiently Answering Regular Path Query in Streaming Graphs 2024 VLDB 5.3772821e-05
9,030 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.2340466e-05
9,148 In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework 2024 SIGMOD 5.2189946e-05
9,485 PG-Triggers: Triggers for Property Graphs 2024 SIGMOD 5.1708619e-05
10,062 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.0875952e-05
10,105 View-based Explanations for Graph Neural Networks 2024 SIGMOD 5.0789354e-05
10,157 Automating Incremental Graph Processing with Flexible Memoization 2021 VLDB 5.0706053e-05
10,254 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.050482e-05
10,555 Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings 2026 SIGMOD 4.9793485e-05
10,617 An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] 2026 SIGMOD 4.9793485e-05
10,740 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 4.9793485e-05
10,989 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 4.9793485e-05
11,175 AJOSC: Adaptive Join Order Selection for Continuous Queries 2025 SIGMOD 4.9793485e-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.00058781151
208 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024884544
288 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00021969641
355 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020124083
438 Taming Verification Hardness: An Efficient Algorithm for Testing Subgraph Isomorphism 2008 VLDB 0.00018286607
490 TurboISO: Towards UltraFast and Robust Subgraph Isomorphism Search in Large Graph Databases 2013 SIGMOD 0.00017438618
657 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.0001505607
954 RDF-3X: a RISC-style Engine for RDF 2008 VLDB 0.00012867202
1,045 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012322402
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.00011627329
1,317 Incremental Graph Pattern Matching 2011 SIGMOD 0.00011050011
1,410 A Distributed Graph Engine for Web Scale RDF Data 2013 VLDB 0.00010742208
1,506 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010452205
1,804 gStore: Answering SPARQL Queries via Subgraph Matching 2011 VLDB 9.6025094e-05
2,632 Hybrid Garbage Collection for Multi-Version Concurrency Control in SAP HANA 2016 SIGMOD 8.1995358e-05
4,551 Querying Big Graphs within Bounded Resources 2014 SIGMOD 6.5401646e-05
4,583 Event Pattern Matching over Graph Streams 2015 VLDB 6.5187824e-05
4,817 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.3985024e-05
6,199 StreamWorks - A system for Dynamic Graph Search 2013 SIGMOD 5.8516543e-05
Previous Page 1 / 1 Next

Semantically Similar Papers