Efficient Subgraph Matching on Large RDF Graphs Using MapReduce
Abstract With the popularity of knowledge graphs growing rapidly, large amounts of RDF graphs have been released, which raises the need for addressing the challenge of distributed subgraph matching queries. In this paper, we propose an efficient distributed method to answer subgraph matching queries...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2019-04-01
|
| Series: | Data Science and Engineering |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1007/s41019-019-0090-z |