Simulating classical query rewriting algorithms with SLD-resolution

Christophe Rey (1, 2, 3) , Elias Tahhan-Bittar , Jerzy Tomasik

1 UCA [2017-2020] - Université Clermont Auvergne [2017-2020]
2 IUT d'Allier - IUT d'Allier
3 LIMOS - Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes

We present experimental results that indicate that SLD-resolution could be considered as a unifying framework for the studying of query rewriting algorithms. Indeed, adding constraints to the control of SLD-resolution makes it simulate some of the classical query rewriting algorithms used in mediation systems. We propose 4 such constraints and link SLD-resolution to 3 classical algorithms: the bucket, the inverse-rules and the MINICON algorithms.

Mots clés: SLD-resolution; maximally contained rewritings; certain answers; definite program; conjunctive query; local-as-view; mediation; data integration; rewriting algorithm; open world assumption; algorithmic framework

Domaines: Intelligence artificielle [cs.AI]; Base de données [cs.DB]; Logique en informatique [cs.LO]

Christophe Rey, Elias Tahhan-Bittar, Jerzy Tomasik. Simulating classical query rewriting algorithms with SLD-resolution. 2019. ⟨hal-02062409⟩