Abstract. The OWL 2 QL profile has been designed to facilitate query answering via query rewriting. This paper presents an optimized query rewriting algorithm which takes advantage of the special characteristics of the query rewriting problem via first-order resolution in OWL 2 QL and computes efficiently the set of the non redundant rewritings of a user query, by avoiding blind and redundant inferences, as well as by reducing the need for extended query subsumption checks. The evaluation shows that in several cases the algorithm achieves a significant improvement and better scalability if compared to other similar approaches.

No abstract

No abstract

No abstract

No abstract