Crossmark

Efficient Subgraph Matching on Large RDF Graphs Using MapReduce

Crossref DOI link: https://doi.org/10.1007/s41019-019-0090-z

Published Online: 2019-04-04

Published Print: 2019-03

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Wang, Xin

Chai, Lele

Xu, Qiang

Yang, Yajun https://orcid.org/0000-0002-0824-2931
Li, Jianxin

Wang, Junhu

Chai, Yunpeng
Funding

Funding for this research was provided by:

National Natural Science Foundation of China (61572353)

National Natural Science Foundation of China (61402323)

National Natural Science Foundation of China (61472427)

Natural Science Foundation of Tianjin City (17JCYBJC15400)

Natural Science Foundation of Beijing (4172031)
License Information

Text and Data Mining valid from 2019-03-01
More Information

Article History

Received: 15 January 2019

Revised: 20 March 2019

Accepted: 23 March 2019

First Online: 4 April 2019

Compliance with Ethical Standards

:

: The authors declare that they have no competing interests.

: The datasets generated and analyzed during the current study are available in the WatDiv, LUBM, and DBpedia repository, WatDiv (), LUBM (), and DBpedia ().