On Continuously Matching of Evolving Graph Patterns-Reference-Cited by-同舟云学术

On Continuously Matching of Evolving Graph Patterns

Published:2019-11-03 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 28th ACM International Conference on Information and Knowledge Management
language:
Short-container-title:

Author:

Zhang Qianzhen¹,Guo Deke¹,Zhao Xiang¹,Guo Aibo¹

Affiliation:

1. National University of Defense Technology, Changsha, China

Funder

National Natural Science Foundation of China

Tianjin Science and Technology Foundation

Natural Science Foundation of Hunan Province

National Program for Support of Top-Notch Young Professionals of National Program for Special Support of Eminent Professionals

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3357384.3358101

Reference5 articles.

1. Efficient Subgraph Matching by Postponing Cartesian Products

2. Taming verification hardness

3. Shixuan Sun and Qiong Luo. 2019. Scaling Up Subgraph Query Processing with Efficient Subgraph Matching. In ICDE. 220--231. Shixuan Sun and Qiong Luo. 2019. Scaling Up Subgraph Query Processing with Efficient Subgraph Matching. In ICDE. 220--231.

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

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

2. Efficient continuous subgraph matching scheme considering data reuse;Knowledge-Based Systems;2023-12

3. Discovering Association Rules with Graph Patterns in Temporal Networks;Tsinghua Science and Technology;2023-04

4. Discovering Frequency Bursting Patterns in Temporal Graphs;2023 IEEE 39th International Conference on Data Engineering (ICDE);2023-04

5. A survey of continuous subgraph matching for dynamic graphs;Knowledge and Information Systems;2022-10-19