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 …

Given a query graph q and a data graph g, the subgraph isomorphism search finds all
occurrences of q in g and is considered one of the most fundamental query types for many …

The ability to handle large scale graph data is crucial to an increasing number of
applications. Much work has been dedicated to supporting basic graph operations such as …

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 …

Finding subgraph isomorphisms is an important problem in many applications which deal
with data modeled as graphs. While this problem is NP-hard, in recent years, many …

The dramatic proliferation of sophisticated networks has resulted in a growing need for
supporting effective querying and mining methods over such large-scale graph-structured …

Graph matching is essential in several fields that use structured information, such as biology,
chemistry, social networks, knowledge management, document analysis and others. Except …