We study reasoning, and in particular query answering, over databases with tuple-generating dependencies (TGDs). Our focus is on classes of TGDs for which conjunctive query answering is first-order rewritable, i.e., can be reduced to the standard evaluation of a first-order query over the database. In this paper, we define the class of weakly recursive TGDs, and prove that this class comprises and generalizes every previously known FOL-rewritable class of TGDs, under fairly general assumptions on the form of the TGDs. © 2012 Springer-Verlag.
A broad class of first-order rewritable tuple-generating dependencies / Civili, Cristina; Rosati, Riccardo. - STAMPA. - 7494 LNCS:(2012), pp. 68-80. (Intervento presentato al convegno 2nd International Workshop on Datalog in Academia and Industry, Datalog 2.0 tenutosi a Vienna nel 11 September 2012 through 13 September 2012) [10.1007/978-3-642-32925-8_8].
A broad class of first-order rewritable tuple-generating dependencies
CIVILI, CRISTINA;ROSATI, Riccardo
2012
Abstract
We study reasoning, and in particular query answering, over databases with tuple-generating dependencies (TGDs). Our focus is on classes of TGDs for which conjunctive query answering is first-order rewritable, i.e., can be reduced to the standard evaluation of a first-order query over the database. In this paper, we define the class of weakly recursive TGDs, and prove that this class comprises and generalizes every previously known FOL-rewritable class of TGDs, under fairly general assumptions on the form of the TGDs. © 2012 Springer-Verlag.File | Dimensione | Formato | |
---|---|---|---|
VE_2012_11573-501905.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
292.81 kB
Formato
Adobe PDF
|
292.81 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.