Distributed Subgraph Matching on Big Knowledge Graphs Using Pregel

Distributed Subgraph Matching on Big Knowledge Graphs Using Pregel

With RDF becoming the de facto standard for representing knowledge graphs, it is indispensable to develop scalable subgraph matching algorithms over big RDF graphs stored in distributed clusters. In this paper, we propose a novel distributed subgraph matching method SP-Tree, using the Pregel model,...

Full description

Bibliographic Details
Main Authors: Qiang Xu, Xin Wang, Jianxin Li, Qingpeng Zhang, Lele Chai
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Subgraph matching
distributed
knowledge graphs
RDF
Pregel
Online Access:https://ieeexplore.ieee.org/document/8807148/

Internet

https://ieeexplore.ieee.org/document/8807148/

Similar Items