PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Borgida A., De Bruijn J., Franconi E., Seylan I., Straccia U., Toman D., Weddell G. On finding query rewritings under expressive constraints. In: SEBD 2010 - 18th Italian Symposium on Advanced Database Systems (Rimini, 20-23 June 2010). Atti, pp. 426 - 437. Sonia Bergamaschi, Stefano Lodi, Riccardo Martoglia, Claudio Sartori (eds.). SocietÓ Editrice Esculapio, 2010.
 
 
Abstract
(English)
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 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. It is particularly concerned with applying this framework to finding effectively executable first-order reformulations (i.e., range-restricted reformulations) a la SQL.
Subject Database
Query rewriting
H.2 Database Management


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional