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,...
Guardat en:
| Autors principals: | , , , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
IEEE
2019-01-01
|
| Col·lecció: | IEEE Access |
| Matèries: | |
| Accés en línia: | https://ieeexplore.ieee.org/document/8807148/ |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|