On finding query rewritings under expressive constraints
Alexander T. Borgida, Jos de Bruijn, Enrico Franconi, İnanç Seylan, Umberto Straccia, David Toman, Grant Weddell · 2010
Abstract We study a general framework for query rewriting in the presence of general FOL constraints, where standard theorem proving techniques (e.g., tableau or resolution) can be used. The framework supports deciding the existence of an equivalent first-order reformulation of a query in terms of a selected set of database predicates, and if so, it provides an effective approach to constructing such a reformulation based on interpolation. The reformulation is effectively executable as a SQL query, i.e., it is a range-restricted reformulation. 1