Circinus: Fast Redundancy-Reduced Subgraph Matching

Author:

Jin Tatiana1ORCID,Li Boyang2ORCID,Li Yichao1ORCID,Zhou Qihui2ORCID,Ma Qianli2ORCID,Zhao Yunjian2ORCID,Chen Hongzhi3ORCID,Cheng James2ORCID

Affiliation:

1. The Chinese University of Hong Kong & Kasma Pte Ltd., Hong Kong, Hong Kong

2. The Chinese University of Hong Kong, Hong Kong, Hong Kong

3. Kasma Pte Ltd., Singapore, Singapore

Abstract

Subgraph matching is one of the most important problems in graph analytics. Many algorithms and systems have been proposed for subgraph matching. Most of these works follow Ullmann's backtracking approach as it is memory-efficient in handling an explosive number of intermediate matching results. However, they have largely overlooked an intrinsic problem of backtracking, namely repeated computation, which contributes to a large portion of the heavy computation in subgraph matching. This paper proposes a subgraph matching system, Circinus, which enables effective computation sharing by a new compression-based backtracking method. Our extensive experiments show that Circinus significantly reduces repeated computation, which transfers to up to several orders of magnitude performance improvement.

Publisher

Association for Computing Machinery (ACM)

Reference47 articles.

1. Distributed evaluation of subgraph queries using worst-case optimal low-memory dataflows

2. Bibek Bhattarai , Hang Liu , and H. Howie Huang . 2019. CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching . In Proceedings of the 2019 International Conference on Management of Data, SIGMOD Conference 2019 , Amsterdam, The Netherlands, June 30 - July 5, 2019 , Peter A. Boncz, Stefan Manegold, Anastasia Ailamaki, Amol Deshpande, and Tim Kraska (Eds.). ACM, 1447--1462. https://doi.org/10.1145/3299869.3300086 10.1145/3299869.3300086 Bibek Bhattarai, Hang Liu, and H. Howie Huang. 2019. CECI: Compact Embedding Cluster Index for Scalable Subgraph Matching. In Proceedings of the 2019 International Conference on Management of Data, SIGMOD Conference 2019, Amsterdam, The Netherlands, June 30 - July 5, 2019, Peter A. Boncz, Stefan Manegold, Anastasia Ailamaki, Amol Deshpande, and Tim Kraska (Eds.). ACM, 1447--1462. https://doi.org/10.1145/3299869.3300086

3. Efficient Subgraph Matching by Postponing Cartesian Products

4. A subgraph isomorphism algorithm and its application to biochemical data

5. High-performance dynamic pattern matching over disordered streams

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

1. An adaptive graph sampling framework for graph analytics;Social Network Analysis and Mining;2023-12-06

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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