[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15]

Journal of Information Science and Engineering, Vol. 34 No. 2, pp. 489-504

RDF Keyword Search Using a Type-based Summary

1School of Computer Science and Engineering
Northeastern University
Shenyang, Liaoning, 110819 P.R. China

2College of Computer Science and Technology
Nanjing University of Aeronautics and Astronautics
Nanjing, Jiangsu, 211106 P.R. China

3School of Information Engineering
Eastern Liaoning University
Dandong, Liaoning, 118003 P.R. China

Keyword search enjoys great popularity due to succinctness and easy operability for exploring RDF data. SPARQL has been recommended as the standard query language. Thus, keyword search based on keywords-to-SPARQL attracts more and more attention. However, existing solutions have main limitations that the summary index used for translation is incomplete and thus results returned are wrong or short of some answers. To address the issues, we propose an original RDF keyword search paradigm based on the translation of keywords-to-SPARQL queries. We present a new type-based summary which summarizes all the inter-entity relationships from RDF data. We exploit an efficient search algorithm to quickly find the top-k subgraphs connecting all entering keyword elements. Then, a transforming algorithm is leveraged to translate top-k subgraphs into top-k SPARQL queries that are eventually executed by a SPARQL query engine. The experiments show that our approach takes shorter query response time and more accurate results are achieved than existing techniques.

Keywords: RDF keyword search, SPARQL, type-based summary, query translation, RDF data graph

  Retrieve PDF document (JISE_201802_11.pdf)