Simulating classical query rewriting algorithms with SLD-resolution
Résumé
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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...