While advances in computing resources have made processing enormous amounts of data
possible, human ability to identify patterns in such data has not scaled accordingly. Efficient …

Besides its NP-completeness, the strict constraints of subgraph isomorphism are making it
impractical for graph pattern matching (GPM) in the context of big data. As a result, relaxed …

In this paper, we study the problem of subgraph matching that extracts all subgraph
isomorphic embeddings of a query graph q in a large data graph G. The existing algorithms …

Subgraph matching (or subgraph isomorphism) is one of the fundamental problems in graph
analysis. Extensive research has been done to develop practical solutions for subgraph …

We study the performance of eight representative in-memory subgraph matching algorithms.
Specifically, we put QuickSI, GraphQL, CFL, CECI, DP-iso, RI and VF2++ in a common …

Subgraph matching finds all distinct isomorphic embeddings of a query graph on a data
graph. For large graphs, current solutions face the scalability challenge due to expensive …

Graph pattern matching, which aims to discover structural patterns in graphs, is considered
one of the most fundamental graph mining problems in many real applications. Despite …

Subgraph query processing (also known as subgraph search) and subgraph matching are
fundamental graph problems in many application domains. A lot of efforts have been made …

Querying heterogeneous and large-scale knowledge graphs is expensive. This paper
studies a graph summarization framework to facilitate knowledge graph search.(1) We …

We propose a class of functional dependencies for graphs, referred to as GFDs. GFDs
capture both attribute-value dependencies and topological structures of entities, and …