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

被引:50
|
作者
Kim, Kyongmin [1 ]
Lee, Jeong-Hoon [1 ]
Seo, In [1 ]
Hong, Sungpack [2 ]
Han, Wook-Shin [1 ]
Chafi, Hassan [2 ]
Shin, Hyungyu [1 ]
Jeong, Geonhwa [1 ]
机构
[1] Pohang Univ Sci & Technol POSTECH, Pohang, South Korea
[2] Oracle Labs, Redwood City, CA USA
基金
新加坡国家研究基金会;
关键词
ALGORITHM; ENGINE;
D O I
10.1145/3183713.3196917
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A dynamic graph is defined by an initial graph and a graph update stream consisting of edge insertions and deletions. Identifying and monitoring critical patterns in the dynamic graph is important in various application domains such as fraud detection, cyber security, and emergency response. Given a dynamic data graph and a query graph, a continuous subgraph matching system reports positive matches for an edge insertion and reports negative matches for an edge deletion. Previous systems show significantly low throughput due to either repeated subgraph matching for each edge update or expensive overheads in maintaining enormous intermediate results. We present a fast continuous subgraph matching system called TurboFlux which provides high throughput over a fast graph update stream. TurboFlux employs a concise representation of intermediate results, and its execution model allows fast incremental maintenance. Our empirical evaluation shows that TurboFlux significantly outperforms existing competitors by up to six orders of magnitude.
引用
收藏
页码:411 / 426
页数:16
相关论文
共 50 条
  • [1] Fast Subgraph Matching by Dynamic Graph Editing
    Jiang, Zite
    Zhang, Shuai
    Liu, Boxiao
    Hou, Xingzhong
    Yuan, Mengting
    You, Haihang
    [J]. IEEE Transactions on Services Computing, 2024, 17 (05): : 2432 - 2443
  • [2] Mnemonic: A Parallel Subgraph Matching System for Streaming Graphs
    Bhattarai, Bibek
    Huang, Howie
    [J]. 2022 IEEE 36TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS 2022), 2022, : 313 - 323
  • [3] An Efficient Continuous Subgraph Matching Scheme over Graph Streams
    Choi, Dojin
    Lim, Jongtae
    Bok, Kyoungsoo
    Yoo, Jaesoo
    [J]. PROCEEDINGS OF THE 2018 CONFERENCE ON RESEARCH IN ADAPTIVE AND CONVERGENT SYSTEMS (RACS 2018), 2018, : 183 - 188
  • [4] Subgraph-Indexed Sequential Subdivision for Continuous Subgraph Matching on Dynamic Knowledge Graph
    Sun, Yunhao
    Li, Guanyu
    Guan, Mengmeng
    Ning, Bo
    [J]. COMPLEXITY, 2020, 2020
  • [5] Streaming Temporal Graphs: Subgraph Matching
    Goodman, Eric L.
    Grunwald, Dirk
    [J]. 2019 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2019, : 4977 - 4986
  • [6] Subgraph learning for graph matching
    Nie, Weizhi
    Ding, Hai
    Liu, Anan
    Deng, Zonghui
    Su, Yuting
    [J]. PATTERN RECOGNITION LETTERS, 2020, 130 (130) : 362 - 369
  • [7] An Edge-Based Framework for Fast Subgraph Matching in a Large Graph
    Kim, Sangjae
    Song, Inchul
    Lee, Yoon Joon
    [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, PT I, 2011, 6587 : 404 - 417
  • [8] Efficient continuous subgraph matching scheme considering data reuse
    Choi, Dojin
    Lee, Hyeonbyeong
    Lim, Jongtae
    Bok, Kyoungsoo
    Yoo, Jaesoo
    [J]. KNOWLEDGE-BASED SYSTEMS, 2023, 282
  • [9] A graph matching method and a graph matching distance based on subgraph assignments
    Raveaux, Romain
    Burie, Jean-Christophe
    Ogier, Jean-Marc
    [J]. PATTERN RECOGNITION LETTERS, 2010, 31 (05) : 394 - 406
  • [10] Graph Reachability Pruning: Adaptive Data Reduction for Inexact Subgraph Matching
    Abodo, Franklin
    Marvin, Phillip
    Brown, Joanna
    [J]. 2022 IEEE INTERNATIONAL CONFERENCE ON KNOWLEDGE GRAPH (ICKG), 2022, : 1 - 5