RapidFlow

Author:

Sun Shixuan1,Sun Xibo2,He Bingsheng1,Luo Qiong2

Affiliation:

1. National University of Singapore, Singapore

2. Hong Kong University of Science and Technology, Hong Kong, China

Abstract

Continuous subgraph matching (CSM) is an important building block in many real-time graph processing applications. Given a subgraph query Q and a data graph stream, a CSM algorithm reports the occurrences of Q in the stream. Specifically, when a new edge e arrives in the stream, existing CSM algorithms start from the inserted e in the current data graph G to search Q. However, this rigid matching order of always starting from e can lead to a massive number of partial results that will turn out futile. Also, if Q contains automorphisms, there will be a lot of redundant computation in the matching process. To address these two problems, we propose RapidFlow, an effective approach to CSM. First, we design a query reduction technique, which reduces CSM to batch subgraph matching (BSM) where we enumerate all results in a region of G that will be affected by the update. The well-established BSM techniques can determine effective matching orders, not necessarily starting from the newly inserted edge. Second, to eliminate redundant computation caused by automorphisms in Q , we propose dual matching, which leverages the duality of Q and G in the matching process. Extensive experiment results show that RapidFlow outperforms state-of-the-art algorithms, including TurboFlux and SymBi, by up to two orders of magnitude on various workloads.

Publisher

Association for Computing Machinery (ACM)

Subject

General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development

Reference39 articles.

1. EmptyHeaded

2. Design and Implementation of the LogicBlox System

3. CECI

4. Efficient Subgraph Matching by Postponing Cartesian Products

5. Vincenzo Bonnici , Rosalba Giugno , Alfredo Pulvirenti , Dennis E. Shasha , and Alfredo Ferro . 2013. A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinform. 14 , S-7 ( 2013 ), S13. Vincenzo Bonnici, Rosalba Giugno, Alfredo Pulvirenti, Dennis E. Shasha, and Alfredo Ferro. 2013. A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinform. 14, S-7 (2013), S13.

Cited by 13 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. TC-Match: Fast Time-Constrained Continuous Subgraph Matching;Proceedings of the VLDB Endowment;2024-07

2. In-depth Analysis of Continuous Subgraph Matching in a Common Delta Query Compilation Framework;Proceedings of the ACM on Management of Data;2024-05-29

3. GCSM: GPU-Accelerated Continuous Subgraph Matching for Large Graphs;2024 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2024-05-27

4. Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

5. Efficient Multi-Query Oriented Continuous Subgraph Matching;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3