A semantic keyword search based on the bidirectional fix root query graph construction algorithm

Abstract

In the last few years, the large amount of personal information in RDF format is widely deployed. To access the semantic information, it needs a semantic formal query (e.g. SPARQL query). However, this kind of query requires users to know the ontology structure and master its syntax. This paper proposes the X-SKengine, the semantic keyword search engine for specific expert discovery domain. The X-SKengine transforms the user keywords to the SPARQL query using a bidirectional fix root query graph construction algorithm which is able to compute the query graphs without limitation of the directions of relationships in ontologies. The experiment was conducted to compare the capability of SPARQL query construction between X-S Kengine and the previous version. The results show that X-SKengine can automatically construct SPARQL queries relevant to meaning of user keywords for various ontology structures.