Simulating classical query rewriting algorithms with SLD-resolution

Abstract : 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.
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02062409
Contributor : Christophe Rey <>
Submitted on : Monday, April 1, 2019 - 3:02:53 PM
Last modification on : Friday, April 5, 2019 - 1:20:19 AM
Long-term archiving on : Tuesday, July 2, 2019 - 12:06:04 PM

File

Unpublished_2018_CRey.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02062409, version 1

Collections

Citation

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

Share

Metrics

Record views

54

Files downloads

93