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 pattern matching algorithms to handle million-scale dynamic graphs are widely used
in many applications such as social network analytics and suspicious transaction detections …

Graph pattern matching has been widespread used for protein structure analysis, expert
finding and social group selection, ect. Recently, the study of graph pattern matching using …

Exact subgraph matching is fundamental to numerous graph data applications. The inherent
NP-completeness of subgraph isomorphism poses significant challenges in develo** …

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 …

Finding or monitoring subgraph instances that are isomorphic to a given pattern graph in a
data graph is a fundamental query operation in many graph analytic applications, such as …

Continuous subgraph matching (CSM) is an operation that keeps processing subgraph
queries on a dynamic data graph. This operation is essential to many applications, but it is …

Finding or monitoring subgraph instances that are isomorphic to a given pattern graph in a
data graph is a fundamental query operation in many graph analytic applications, such as …

Gradoop, the distributed graph processing system developed by the Database Group at
Leipzig University, is able to handle two types of graphs: extended property graphs as …