On finding query rewritings under expressive constraints

Alex Borgida, Jos De Bruijn, Enrico Franconi, Inanç Seylan, Umberto Straccia, David Toman, Grant Weddell

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationSEBD 2010 - Proceedings of the 18th Italian Symposium on Advanced Database Systems
PublisherEsculapio Editore
Pages426-437
Number of pages12
ISBN (Print)9788874883691
StatePublished - 2010
Event18th Italian Symposium on Advanced Database Systems, SEBD 2010 - Rimini, Italy
Duration: Jun 20 2010Jun 23 2010

Publication series

NameSEBD 2010 - Proceedings of the 18th Italian Symposium on Advanced Database Systems

Other

Other18th Italian Symposium on Advanced Database Systems, SEBD 2010
Country/TerritoryItaly
CityRimini
Period6/20/106/23/10

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'On finding query rewritings under expressive constraints'. Together they form a unique fingerprint.

Cite this