A Sound and Complete Chase Procedure for Constrained Tuple-Generating Dependencies

Deming Dou 1 Stéphane Coulondre 1
1 BD - Base de Données
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : We present a chase procedure for solving the implication problem of constrained tuple-generating dependencies (ctgds), a general class of database dependencies that is also able to handle data and predicates on interpreted domains. Current chase procedures for ctgds are sound but not complete, in the sense that they are unguaranteed to stop successfully whenever implication is true. The procedure we present is sound and complete, the first to our knowledge. It follows a linear reasoning over constraint domains that have the Independence of Negative Constraints property.We then soundly extend this procedure by a disjunctive reasoning over unrestricted constraint domains. To achieve these results, we used a different approach. Previous chases act like a closure operator, whereas we used a goal-directed design.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01339129
Contributor : Équipe Gestionnaire Des Publications Si Liris <>
Submitted on : Wednesday, June 29, 2016 - 3:45:56 PM
Last modification on : Thursday, November 21, 2019 - 2:22:05 AM

Links full text

Identifiers

Citation

Deming Dou, Stéphane Coulondre. A Sound and Complete Chase Procedure for Constrained Tuple-Generating Dependencies. Journal of Intelligent Information Systems, 2013, 1, 40, pp.63-84. ⟨10.1007/s10844-012-0216-5⟩. ⟨hal-01339129⟩

Share

Metrics

Record views

159