Hasse diagram based algorithm for continuous temporal subgraph query in graph stream

• Published in: 2017 6th International Conference on Computer Science and Network Technology (ICCSNT) pp. 241 - 246
• Main Authors: Sun, Xiaoli, Tan, Yusong, Wu, Qingbo, Wang, Jing
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.10.2017
• Subjects: Continuous query; Cyberattack; Graph stream; Hasse diagram; Heuristic algorithms; Monitoring; Pattern matching; Social network services; Telephone sets; Temporal subgraph query; Topology
• DOI: 10.1109/ICCSNT.2017.8343695

Continuous subgraph pattern matching is an extension of the traditional subgraph pattern matching and becoming a subject that attracts increasing interest. It requires the near real-time responses and is used in many applications, for example, abnormal monitoring in social networks, cyber attacks monitoring in cyber networks. As the dynamic graph changes with time, the temporal subgraph pattern (i.e., the edges have temporal relation) is considered. In this paper, the Hasse diagram is introduced to represent the temporal relation of the query graph. Then we design the Hasse-cache structure, and propose a continuous temporal subgraph pattern matching algorithm based on the Hasse diagram. The algorithm uses the probability of dynamic graph to reduce the intermediate results, and can implement the matching of topology and the verification of temporal relation simultaneously. Our experiments with real-world datasets show that the proposed algorithm has 10x speedups over the previous approaches.