Numerous irregular graph datasets, for example social networks or web graphs, may contain
even trillions of edges. Often, their structure changes over time and they have domain …

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 …

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 …

Worst-case optimal join algorithms are attractive from a theoretical point of view, as they offer
asymptotically better runtime than binary joins on certain types of queries. In particular, they …

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 …

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 …

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 …

GraphScope is a system and a set of language extensions that enable a new programming
interface for large-scale distributed graph computing. It generalizes previous graph …

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 …

The Social Network Benchmark's Business Intelligence workload (SNB BI) is a
comprehensive graph OLAP benchmark targeting analytical data systems capable of …