Integrity Constraints in Federated Databases

1997 ◽  
pp. 43-57 ◽  
Author(s):  
Martin S. Olivier
Keyword(s):  
Integrity Constraints ◽  
Federated Databases

Managing Inconsistent Databases Using Active Integrity Constraints

2005 ◽  
pp. 345-350
Author(s):  
Sergio Flesca ◽  
Sergio Greco ◽  
Ester Zumpano
Keyword(s):  
Data Warehousing ◽  
Integrity Constraints ◽  
Database Integration ◽  
Functional Dependencies ◽  
Minimal Set ◽  
Federated Databases ◽  
Inconsistent Databases ◽  
Conflicting Information ◽  
Integration Data ◽  
Inconsistent Database

Integrity constraints are a fundamental part of a database schema. They are generally used to define constraints on data (functional dependencies, inclusion dependencies, exclusion dependencies, etc.), and their enforcement ensures a semantically correct state of a database. As the presence of data inconsistent with respect to integrity constraints is not unusual, its management plays a key role in all the areas in which duplicate or conflicting information is likely to occur, such as database integration, data warehousing, and federated databases (Bry, 1997; Lin, 1996; Subrahmanian, 1994). It is well known that the presence of inconsistent data can be managed by “repairing” the database, that is, by providing consistent databases, obtained by a minimal set of update operations on the inconsistent original environment, or by consistently answering queries posed over the inconsistent database.

Modelling spatial integrity constraints with OCL

2011 ◽  
Vol 21 (SI) ◽  
pp. 95-123 ◽  
Author(s):  
François Pinet ◽  
Magali Duboisset ◽  
Michel Schneider
Keyword(s):  
Integrity Constraints

CHR grammars

2005 ◽  
Vol 5 (4-5) ◽  
pp. 467-501 ◽  
Author(s):  
HENNING CHRISTIANSEN
Keyword(s):  
Logic Programming ◽  
Integrity Constraints ◽  
Bottom Up ◽  
Context Sensitive ◽  
Language Analysis ◽  
Definite Clause Grammars ◽  
Grammar Rules ◽  
High Flexibility ◽  
Definite Clause ◽  
Specification And Implementation

A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena. The formalism extends previous logic programming based grammars with a form of context-sensitive rules and the possibility to include extra-grammatical hypotheses in both head and body of grammar rules. Among the applications are straightforward implementations of Assumption Grammars and abduction under integrity constraints for language analysis. CHR grammars appear as a powerful tool for specification and implementation of language processors and may be proposed as a new standard for bottom-up grammars in logic programming.

Sign in / Sign up

Export Citation Format

Share Document