Journal of Northeastern University Natural Science ›› 2017, Vol. 38 ›› Issue (1): 22-26.DOI: 10.12068/j.issn.1005-3026.2017.01.005

• Information & Control • Previous Articles     Next Articles

RDF Keyword Search by the Condensed Entity Summary Graph

LIN Xiao-qing1,2, MA Zong-min1   

  1. 1. School of Information Science & Engineering, Northeastern University, Shenyang 110819, China; 2.School of Information Engineering, Eastern Liaoning University, Dandong 118003, China.
  • Received:2015-09-13 Revised:2015-09-13 Online:2017-01-15 Published:2017-01-13
  • Contact: LIN Xiao-qing
  • About author:-
  • Supported by:
    -

Abstract: A method of translating keyword queries to SPARQL queries was presented to implement RDF (resource description framework) keyword search. Firstly, a condensed entity summary was constructed according to connections of RDF data. Then, keywords were located on the designated nodes of the summary graph by the OPS (object predicate subject) index. Top-k subgraphs connecting all keyword entities would be found by a bidirectional search algorithm. Finally, SPARQL queries were obtained by incorporating inter-entity relationships of top-k subgraphs, keywords and their properties, and SPARQL queries were executed by a SPARQL search engine. The experimental results show that a faster response time and a higher accuracy than the existing ones are achieved.

Key words: RDF (resource description framework), SPARQL, OPS (object predicate subject) index, condensed entity summary graph, bidirectional search

CLC Number: