Recent advancements in event processing

M Dayarathna, S Perera - ACM Computing Surveys (CSUR), 2018 - dl.acm.org
Event processing (EP) is a data processing technology that conducts online processing of
event information. In this survey, we summarize the latest cutting-edge work done on EP …

Tempme: Towards the explainability of temporal graph neural networks via motif discovery

J Chen, R Ying - Advances in Neural Information …, 2024 - proceedings.neurips.cc
Temporal graphs are widely used to model dynamic systems with time-varying interactions.
In real-world scenarios, the underlying mechanisms of generating future interactions in …

[HTML][HTML] A survey of continuous subgraph matching for dynamic graphs

X Wang, Q Zhang, D Guo, X Zhao - Knowledge and Information Systems, 2023 - Springer
With the rapid development of information technologies, multi-source heterogeneous data
has become an open problem, and the data is usually modeled as graphs since the graph …

Graph stream summarization: From big bang to big crunch

N Tang, Q Chen, P Mitra - … of the 2016 International Conference on …, 2016 - dl.acm.org
A graph stream, which refers to the graph with edges being updated sequentially in a form of
a stream, has important applications in cyber security and social networks. Due to the sheer …

Big graph analytics platforms

D Yan, Y Bu, Y Tian, A Deshpande - Foundations and Trends® …, 2017 - nowpublishers.com
Due to the growing need to process large graph and network datasets created by modern
applications, recent years have witnessed a surging interest in developing big graph …

Rapidflow: An efficient approach to continuous subgraph matching

S Sun, X Sun, B He, Q Luo - Proceedings of the VLDB Endowment, 2022 - dl.acm.org
Continuous subgraph matching (CSM) is an important building block in many real-time
graph processing applications. Given a subgraph query Q and a data graph stream, a CSM …

An in-depth study of continuous subgraph matching

X Sun, S Sun, Q Luo, B He - Proceedings of the VLDB Endowment, 2022 - dl.acm.org
Continuous subgraph matching (CSM) algorithms find the occurrences of a given pattern on
a stream of data graphs online. A number of incremental CSM algorithms have been …

Turboflux: A fast continuous subgraph matching system for streaming graph data

K Kim, I Seo, WS Han, JH Lee, S Hong… - Proceedings of the …, 2018 - dl.acm.org
A dynamic graph is defined by an initial graph and a graph update stream consisting of edge
insertions and deletions. Identifying and monitoring critical patterns in the dynamic graph is …

Fast and accurate graph stream summarization

X Gou, L Zou, C Zhao, T Yang - 2019 IEEE 35th International …, 2019 - ieeexplore.ieee.org
A graph stream is a continuous sequence of data items, in which each item indicates an
edge, including its two endpoints and edge weight. It forms a dynamic graph that changes …

A survey of typical attributed graph queries

Y Wang, Y Li, J Fan, C Ye, M Chai - World Wide Web, 2021 - Springer
Graphs are commonly used for representing complex structures such as social relationships,
biological interactions, and knowledge bases. In many scenarios, graphs not only represent …