arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2312.10486cs.DB
收藏

利用时间信息进行过滤和回溯的时间约束连续子图匹配

Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and Backtracking

Seunghwan Min, Jihoon Jang, Kunsoo Park, Dora Giammarresi, Giuseppe F. Italiano, Wook-Shin Han

AI总结:

针对时态图上的连续子图匹配问题,提出利用时间信息进行可匹配边过滤与回溯剪枝的新算法,查询速度较现有最优方法最高提升两个数量级。

摘要:

对包含时间信息的图(如社交媒体流、问答网络和网络数据源)进行实时分析,在各类应用中发挥着重要作用。其中,模式检测是基本的图分析问题之一。本文研究时间约束连续子图匹配,即当时态数据图随时间变化时,实时检测在边集上具有严格偏序的模式。我们提出一种基于两项新技术的新算法。首先,引入称为时间约束可匹配边的过滤技术,利用时间信息以多项式空间进行过滤。其次,开发时间约束剪枝技术,在回溯过程中利用时间信息剪枝部分并行边,从而缩小搜索空间。在真实和合成数据集上的大量实验表明,我们的方法在查询处理时间方面比最先进算法最高快两个数量级。

英文摘要:

Real-time analysis of graphs containing temporal information, such as social media streams, Q&A networks, and cyber data sources, plays an important role in various applications. Among them, detecting patterns is one of the fundamental graph analysis problems. In this paper, we study time-constrained continuous subgraph matching, which detects a pattern with a strict partial order on the edge set in real-time whenever a temporal data graph changes over time. We propose a new algorithm based on two novel techniques. First, we introduce a filtering technique called time-constrained matchable edge that uses temporal information for filtering with polynomial space. Second, we develop time-constrained pruning techniques that reduce the search space by pruning some of the parallel edges in backtracking, utilizing temporal information. Extensive experiments on real and synthetic datasets show that our approach outperforms the state-of-the-art algorithm by up to two orders of magnitude in terms of query processing time.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑