This paper introduces active integrity constraints (AICs), an extension of integrity constraints for consistent databasemaintenance. An active integrity constraint is a special constraint whose body contains a conjunction of literals which must be false andwhose head contains a disjunction of update actions representing actions (insertions and deletions of tuples) to be performed if theconstraint is not satisfied (that is its body is true). The AICs work in a domino-like manner as the satisfaction of one AIC may trigger theviolation and therefore the activation of another one. The paper also introduces founded repairs, which are minimal sets of updateactions that make the database consistent, and are specified and “supported” by active integrity constraints. The paper presents: 1) aformal declarative semantics allowing the computation of founded repairs and 2) a characterization of this semantics obtained byrewriting active integrity constraints into disjunctive logic rules, so that founded repairs can be derived from the answer sets of thederived logic program. Finally, the paper studies the computational complexity of computing founded repairs.

Active Integrity Constraints for Database Consistency Maintenance

CAROPRESE L;GRECO, Sergio;ZUMPANO, Ester
2009-01-01

Abstract

This paper introduces active integrity constraints (AICs), an extension of integrity constraints for consistent databasemaintenance. An active integrity constraint is a special constraint whose body contains a conjunction of literals which must be false andwhose head contains a disjunction of update actions representing actions (insertions and deletions of tuples) to be performed if theconstraint is not satisfied (that is its body is true). The AICs work in a domino-like manner as the satisfaction of one AIC may trigger theviolation and therefore the activation of another one. The paper also introduces founded repairs, which are minimal sets of updateactions that make the database consistent, and are specified and “supported” by active integrity constraints. The paper presents: 1) aformal declarative semantics allowing the computation of founded repairs and 2) a characterization of this semantics obtained byrewriting active integrity constraints into disjunctive logic rules, so that founded repairs can be derived from the answer sets of thederived logic program. Finally, the paper studies the computational complexity of computing founded repairs.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11770/123147
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 40
  • ???jsp.display-item.citation.isi??? 22
social impact