Name
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 on big RDF graphs using MapReduce. In our method, query graphs are decomposed into a set of stars that utilize the semantic and structural information embedded RDF graphs as heuristics. Two optimization techniques are proposed to further improve the efficiency of our algorithms. One algorithm, called RDF property filtering, filters out invalid input data to reduce intermediate results; the other is to improve the query performance by postponing the Cartesian product operations. The extensive experiments on both synthetic and real-world datasets show that our method outperforms the close competitors S2X and SHARD by an order of magnitude on average. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s41019-019-0090-z | Data Science and Engineering |
Keywords | Field | DocType |
Star decomposition, Subgraph matching, MapReduce, RDF graphs | Data mining,Graph,Cartesian product,Computer science,Embedded RDF,Filter (signal processing),Shard,Heuristics,RDF,Rdf graph | Journal |
Volume | Issue | ISSN |
4 | 1 | 2364-1185 |
Citations | PageRank | References |
6 | 0.45 | 10 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xin Wang | 1 | 638 | 67.81 |
| Lele Chai | 2 | 7 | 1.15 |
| Qiang Xu | 3 | 7 | 4.54 |
| Yajun Yang | 4 | 10 | 2.21 |
| Jianxin Li | 5 | 443 | 48.67 |
| Junhu Wang | 6 | 343 | 34.99 |
| Yunpeng Chai | 7 | 13 | 4.32 |