Query relaxation is an important problem for querying RDF data flexibly. The previous work mainly uses ontology information for relaxing user queries. The ranking models proposed, however, are either non-quantifiable or imprecise. Furthermore, the recommended relaxed queries may return no results. In this paper, we aim to solve these problems by proposing a new ranking model. The model ranks the relaxed queries according to their similarities to the original user query. The similarity of a relaxed query to the original query is measured based on the difference of their estimated results. To compute similarity values for star queries efficiently and precisely, Bayesian networks are employed to estimate the result numbers of relaxed queries. An algorithm is also proposed for answering top-k queries. At last experiments validate the effectiveness of our method.
Lecture notes in computer science: proceedings of the 11th International Conference on Web Information Systems Engineering (WISE 2010), Hong Kong, China, 12-14 December 2010 / Lei Chan, Peter Triantafillou and Torsten Suel (eds.),
Vol. 6488, pp. 376-389