论文信息 - Extending Inconsistency-Tolerant Integrity Checking by Semantic Query Optimization

Extending Inconsistency-Tolerant Integrity Checking by Semantic Query Optimization

The premise that all integrity constraints be totally satisfied guarantees the correctness of methods for simplified integrity checking, and of semantic query optimization. This premise can be waived for many integrity checking methods. We study how it can be relaxed also for applying semantic query optimization to an inconsistency-tolerant evaluation of simplified constraints.

Hendrik Decker | H. Decker

[1] Jan Chomicki,et al. Consistent query answers in inconsistent databases , 1999, PODS '99.

[2] Jean-Marie Nicolas. Logic for improving integrity checking in relational data bases⋆ , 2004, Acta Informatica.

[3] Jennifer Widom,et al. Constraint checking with partial information , 1994, PODS.

[4] Henning Christiansen,et al. On Simplification of Database Integrity Constraints , 2006, Fundam. Informaticae.

[5] Raghu Ramakrishnan,et al. Database Management Systems , 1976 .

[6] Zongmin Ma,et al. Intelligent Databases: Technologies and Applications , 2006 .

[7] John Grant,et al. Logic-based approach to semantic query optimization , 1990, TODS.

[8] Hendrik Decker,et al. A Relaxed Approach to Integrity and Inconsistency in Databases , 2006, LPAR.

[9] Hendrik Decker,et al. Integrity Checking and Maintenance in Relational and Deductive Database and Beyond , 2007 .

[10] Hendrik Decker,et al. Classifying integrity checking methods with regard to inconsistency tolerance , 2008, PPDP.