DC proposal: Automatically transforming keyword queries to SPARQL on large-scale knowledge bases

3Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Most Web of Data applications focus mainly on using SPARQL for issuing queries. This leads to the Web of Data being difficult to access for non-experts. Another problem that will intensify this challenge is when applying the algorithms on large-scale and decentralized knowledge bases. In the current thesis, firstly we focus on the methods for transforming keyword-based queries into SPARQL automatically. Secondly, we will work on improving those methods in order to apply them on (a large subset of) the Linked Data Web. In an early phase, a heuristic method was proposed for generating SPARQL queries out of arbitrary number of keywords. Its preliminary evaluation showed promising results. So, we are working on the possible improvements for applying that on the large-scale knowledge bases. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Shekarpour, S. (2011). DC proposal: Automatically transforming keyword queries to SPARQL on large-scale knowledge bases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7032 LNCS, pp. 357–364). https://doi.org/10.1007/978-3-642-25093-4_29

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