Skip to main content
Conference ProceedingsOPEN ACCESS

Predicting SPARQL query performance and explaining linked data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8465 LNCS 795-805
DOI: 10.1007/978-3-319-07443-6_53
13Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

As the complexity of the Semantic Web increases, efficient ways to query the Semantic Web data is becoming increasingly important. Moreover, consumers of the Semantic Web data may need explanations for debugging or understanding the reasoning behind producing the data. In this paper, firstly we address the problem of SPARQL query performance prediction. Secondly we discuss how to explain Linked Data in a decentralized fashion. Finally we discuss how to summarize the explanations. © 2014 Springer International Publishing.

Author supplied keywords

Cite

CITATION STYLE

APA

Hasan, R. (2014). Predicting SPARQL query performance and explaining linked data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8465 LNCS, pp. 795–805). Springer Verlag. https://doi.org/10.1007/978-3-319-07443-6_53

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free