Schema integration with integrity constraints

1997 ◽  
pp. 200-214 ◽  
Author(s):  
Stefan Conrad ◽  
Michael Höding ◽  
Gunter Saake ◽  
Ingo Schmitt ◽  
Can Türker
Keyword(s):  
Integrity Constraints ◽  
Schema Integration

MERGING DATABASES UNDER CONSTRAINTS

1998 ◽  
Vol 07 (01) ◽  
pp. 55-76 ◽  
Author(s):  
JINXIN LIN ◽  
ALBERTO O. MENDELZON
Keyword(s):  
Information Systems ◽  
Multiagent Systems ◽  
Majority Rule ◽  
Relational Databases ◽  
Formal Semantics ◽  
Integrity Constraints ◽  
Heterogeneous Databases ◽  
Schema Integration ◽  
First Order ◽  
Special Case

The problem of integrating information from conflicting sources comes up in many current applications, such as cooperative information systems, heterogeneous databases, and multiagent systems. We model this by the operation of merging first-order theories. We propose a formal semantics for this operation and show that it has desirable properties, including abiding by majority rule in case of conflict and syntax independence. We apply our semantics to the special case when the theories to be merged represent relational databases under integrity constraints. We then present a way of merging databases that have different or conflicting schemas caused by problems such as synonyms, homonyms or type conflicts mentioned in the schema integration literature.

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