RDF has seen increased adoption in recent years, prompting the standardization of the
SPARQL query language for RDF, and the development of local and distributed engines for …

The Resource Description Framework (RDF) represents a main ingredient and data
representation format for Linked Data and the Semantic Web. It supports a generic graph …

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 …

There are two types of high-performance graph processing engines: low-and high-level
engines. Low-level engines (Galois, PowerGraph, Snap) provide optimized data structures …

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 …

RDF is increasingly being used to encode data for the semantic web and data exchange.
There have been a large number of works that address RDF data management following …

Subgraph isomorphism is a well-known NP-hard problem that is widely used in many
applications, such as social network analysis and querying over the knowledge graph. Due …

The problem of subgraph matching is one fundamental issue in graph search, which is NP-
Complete problem. Recently, subgraph matching has become a popular research topic in …

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 …

Subgraph querying in a large data graph is interesting for different applications. A recent
study shows that top-k diversified results are useful since the number of matching subgraphs …