Article Dans Une Revue ACM Transactions on Database Systems Année : 2024

Rewriting the Infinite Chase for Guarded TGDs

Michael Benedikt
Stefano Germano
Kevin Kappelmann
Boris Motik

Résumé

Guarded tuple-generating dependencies (GTGDs) are a natural extension of description logics and referential constraints. It has long been known that queries over GTGDs can be answered by a variant of the chase-a quintessential technique for reasoning with dependencies. However, there has been little work on concrete algorithms and even less on implementation. To address this gap, we revisit Datalog rewriting approaches to query answering, where a set of GTGDs is transformed to a Datalog program that entails the same base facts on each base instance. We show that a rewriting consists of "shortcut" rules that circumvent certain chase steps, we present several algorithms that compute a rewriting by deriving such "shortcuts" efficiently, and we discuss important implementation issues. Finally, we show empirically that our techniques can process complex GTGDs derived from synthetic and real benchmarks and are thus suitable for practical use.

Fichier principal
Vignette du fichier
3696416.pdf (861) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte
Licence

Dates et versions

hal-04951448 , version 1 (17-02-2025)

Licence

Identifiants

Citer

Michael Benedikt, Maxime Buron, Stefano Germano, Kevin Kappelmann, Boris Motik. Rewriting the Infinite Chase for Guarded TGDs. ACM Transactions on Database Systems, 2024, 49 (4), pp.1 - 44. ⟨10.1145/3696416⟩. ⟨hal-04951448⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

More