NewSP: A New Search Process for Continuous Subgraph Matching over Dynamic Graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

NewSP: A New Search Process for Continuous Subgraph Matching over Dynamic Graphs

Published:2024-05-13 Issue: Volume:15 Page:3324-3337
ISSN:
Container-title:2024 IEEE 40th International Conference on Data Engineering (ICDE)
language:
Short-container-title:

Author:

Li Ziming¹,Li Youhuan¹,Chen Xinhuan²,Zou Lei³,Li Yang²,Yang Xiaofeng²,Jiang Hongbo¹

Affiliation:

1. Hunan University,College of Computer Science and Electronic Engineering,China

2. Tencent Inc.,China

3. Peking University,China

Funder

NSFC

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx8/10597630/10597390/10597892.pdf?arnumber=10597892

Reference54 articles.

1. An in-depth study of continuous subgraph matching;Sun,2022

2. Real-time twitter recommendation: Online motif detection in large dynamic graphs;Gupta,2014

3. Quantum query complexity of subgraph isomorphism and homomorphism;Kulkarni,2016

4. A selectivity based approach to continuous pattern detection in streaming graphs;Choudhury,2015

5. A (sub)graph isomorphism algorithm for matching large graphs

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP