Presented at: 5th European Semantic Web Conference (ESWC2008)
by Haofen Wang, Kang Zhang, Qiaoling Liu, Duc Thanh Tran, Yong Yu
Webpage: http://dx.doi.org/10.1007/978-3-540-68234-9_43The increasing amount of data on the Semantic Web offers opportunities for semantic search. However, formal query hinders the casual users in expressing their information need as they might be not familiar with the query's syntax or the underlying ontology. Because keyword interfaces are easier to handle for casual users, many approaches aim to translate keywords to formal queries. However, these approaches yet feature only very basic query ranking and do not scale to large repositories. We tackle the scalability problem by proposing a novel clustered-graph structure that corresponds to only a summary of the original ontology. The so reduced data space is then used in the exploration for the computation of top-k queries. Additionally, we adopt several mechanisms for query ranking, which can consider many factors such as the query length and the relevance of ontology elements w.r.t. the query. Our experimental results performed against our implemented system Q2Semantic show that we achieve good performance on many datasets of different sizes.
Keywords: clustered-graph structure, q2semantic, query ranking, scalability, top-k queries, Search Engine, Semantic Web, User Interface
Resource URI on the dog food server: http://data.semanticweb.org/conference/eswc/2008/paper/63
Same as: http://revyu.com/things/eswc-2008-paper-q2semantic-a-search
Same as: http://semanticweb.org/id/Q2Semantic-3A_A_Lightweight_Keyword_Interface_to_Semantic_Search
Explore this resource elsewhere: