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 …

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 …

We study the problem of optimizing subgraph queries using the new worst-case optimal join
plans. Worst-case optimal plans evaluate queries by matching one query vertex at a time …

Graph mining workloads aim to extract structural properties of a graph by exploring its
subgraph structures. General purpose graph mining systems provide a generic runtime to …

The recent adoption of blockchain technologies and open permissionless networks suggest
the importance of peer-to-peer atomic cross-chain transaction protocols. Users should be …

With growing deployment of machine learning (ML) models, ML developers are training or re-
training increasingly more deep neural networks (DNNs). They do so to find the most …

A subgraph query searches for all embeddings in a data graph that are identical to a query
graph. Two kinds of algorithms, either graph exploration based or join based, have been …

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 …