In this paper, we focus on the problem of translating keywords into SPARQL query effectively and propose a novel approach called KAT. KAT takes into account the context of each input keyword and reduces the ambiguity of input keywords by building a keyword index which contains the class information of keywords in RDF data. To explore RDF data graph efficiently, KAT builds a graph index as well. Moreover, a context aware ranking method is proposed to find the most relevant SPARQL query. Extensive experiments are conducted to show that KAT is both effective and efficient.
CITATION STYLE
Wen, Y., Jin, Y., & Yuan, X. (2018). KAT: Keywords-to-SPARQL translation over RDF graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10827 LNCS, pp. 802–810). Springer Verlag. https://doi.org/10.1007/978-3-319-91452-7_51
Mendeley helps you to discover research relevant for your work.