.png){kind=icon}
返回
Top-k Durable Graph Pattern Queries on Temporal Graphs
.png){kind=icon}
PRE
AI
DOI：10.1109/TKDE.2018.2823754.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Graphs offer a natural model for the relationships and interactions among entities, such as those occurring among users in social and cooperation networks, and proteins in biological networks. Since most such networks are dynamic, to capture their evolution over time, we assume a sequence of graph snapshots where each graph snapshot represents the state of the network at a different time instance. Given this sequence, we seek to find the top-k most durable matches of an input graph pattern query, that is, the matches that exist for the longest period of time. The straightforward way to address this problem is to apply a state-of-the-art graph pattern matching algorithm at each snapshot and then aggregate the results. However, for large networks and long sequences, this approach is computationally expensive, since all matches have to be generated at each snapshot, including those appearing only once. We propose a new approach that uses a compact representation of the sequence of graph snapshots, appropriate time indexes to prune the search space, and strategies to determine the duration of the seeking matches. Finally, we present experiments with real datasets that illustrate the efficiency and effectiveness of our approach.
Keyword:
Graph pattern
temporal graph
graph query processing
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.8K
被引数:
3.2W
机构
引用论文
分享收藏Mineralogy and crystal chemistry of Mn, Fe, Co, Ni, and Cu in a deep-sea Pacific polymetallic nodule
OAAI
OAAI分享收藏
分享收藏Diagnostic and Prognostic Value of Plasma Tumor M2 Pyruvate Kinase in Periampullary Cancer.png)
PancreasOAAI
PancreasIF0
OAAI分享收藏
查看更多内容