z-logo
open-access-imgOpen Access
Efficient distributed path computation on RDF knowledge graphs using partial evaluation
Author(s) -
Qaiser Mehmood,
Muhammad Saleem,
Alokkumar Jha,
Mathieu d’Aquin
Publication year - 2021
Publication title -
world wide web
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 0.464
H-Index - 42
eISSN - 1573-1413
pISSN - 1386-145X
DOI - 10.1007/s11280-021-00965-5
Subject(s) - sparql , computer science , rdf , scalability , linked data , named graph , benchmark (surveying) , graph , path (computing) , theoretical computer science , information retrieval , data mining , database , semantic web , computer network , geodesy , geography

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom