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
5625
Venue
SIGMOD
Year
2018
Pagerank
9.010121e-05
Overall Rank
2,182 | 85.04%
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
1,006 Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together 2019 SIGMOD 0.00012699518
1,102 CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching 2019 SIGMOD 0.00012166591
2,190 Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching 2021 SIGMOD 8.9804702e-05
2,288 Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU 2020 VLDB 8.8025299e-05
3,102 Efficient GPU-Accelerated Subgraph Matching 2023 SIGMOD 7.7568687e-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,870 An In-Depth Study of Continuous Subgraph Matching 2022 VLDB 6.061038e-05
5,938 PathEnum: Towards Real-Time Hop-Constrained s-t Path Enumeration 2021 SIGMOD 6.0343238e-05
6,393 BICE: Exploring Compact Search Space by Using Bipartite Matching and Cell-Wide Verification 2023 VLDB 5.8879832e-05
7,365 Extending Graph Patterns with Conditions 2020 SIGMOD 5.6329929e-05
8,046 LM-SRPQ: Efficiently Answering Regular Path Query in Streaming Graphs 2024 VLDB 5.5007031e-05
8,871 MatCo: Computing Match Cover of Subgraph Query over Graph Data 2025 SIGMOD 5.35418e-05
9,308 PG-Triggers: Triggers for Property Graphs 2024 SIGMOD 5.289545e-05
9,440 In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework 2024 SIGMOD 5.2680376e-05
9,872 TC-Match: Fast Time-constrained Continuous Subgraph Matching 2024 VLDB 5.2043672e-05
9,922 View-based Explanations for Graph Neural Networks 2024 SIGMOD 5.1955087e-05
9,967 Automating Incremental Graph Processing with Flexible Memoization 2021 VLDB 5.1869874e-05
10,354 Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings 2026 SIGMOD 5.093636e-05
10,419 A Comprehensive Survey of Subgraph Matching: [Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,428 An Extensive Experimental Study of Indexes in Continuous Subgraph Matching:[Experiments & Analysis] 2026 SIGMOD 5.093636e-05
10,558 Characterizing Parallel Subgraph Matching Performance: A Systematic Study of Interactions, Scalability, and Enumeration 2026 VLDB 5.093636e-05
10,590 Aquila: A High-Concurrency System for Incremental Graph Query 2026 VLDB 5.093636e-05
10,749 AJOSC: Adaptive Join Order Selection for Continuous Queries 2025 SIGMOD 5.093636e-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.00058720861
211 EmptyHeaded: A Relational Engine for Graph Processing 2016 SIGMOD 0.00024797217
294 Graphs-at-a-time: Query Language and Access Methods for Graph Databases 2008 SIGMOD 0.00022253507
352 On Graph Query Optimization in Large Networks 2010 VLDB 0.00020375193
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
659 Efficient Subgraph Matching by Postponing Cartesian Products 2016 SIGMOD 0.00015214062
944 RDF-3X: a RISC-style Engine for RDF 2008 VLDB 0.00013067088
1,058 Graphflow: An Active Graph Database 2017 SIGMOD 0.00012378784
1,181 An In-depth Comparison of Subgraph Isomorphism Algorithms in Graph Databases 2013 VLDB 0.0001179597
1,296 Incremental Graph Pattern Matching 2011 SIGMOD 0.00011269684
1,387 A Distributed Graph Engine for Web Scale RDF Data 2013 VLDB 0.00010949523
1,487 Exploiting Vertex Relationships in Speeding up Subgraph Isomorphism over Large Graphs 2015 VLDB 0.00010615297
1,774 gStore: Answering SPARQL Queries via Subgraph Matching 2011 VLDB 9.7870727e-05
3,434 Hybrid Garbage Collection for Multi-Version Concurrency Control in SAP HANA 2016 SIGMOD 7.4172842e-05
4,474 Querying Big Graphs within Bounded Resources 2014 SIGMOD 6.6803983e-05
4,503 Event Pattern Matching over Graph Streams 2015 VLDB 6.6597953e-05
4,748 Taming Subgraph Isomorphism for RDF Query Processing 2015 VLDB 6.5251089e-05
6,095 StreamWorks - A system for Dynamic Graph Search 2013 SIGMOD 5.9782101e-05
Previous Page 1 / 1 Next

Semantically Similar Papers