Integrating Data from Possibly Inconsistent Databases

نویسنده

  • Phan Minh Dung
چکیده

We address the problem of data inconsistencies while integrating data sets from multiple autonomous relational databases. We start by arguing that the semantics of integrating possibly inconsistent data is naturally captured by the maximal consistent subsets of the set of all information contained in the collected data. Based on this idea, we propose a simple and intuitive semantical framework, called the integrated relational calculus which is an extension of the classical relational calculus, for manipulating and querying possibly inconsistent data. We then show that our model generalizes the recently proposed model of flexible relational algebra of Agarwal, Keller, Wiederhold and Saraswat in the sense that the latter can be embedded into the former. We also shows that the flexible relational model is not capable to integrate correctly relations with more than one keys. We further argue that flexible relational model provides a rather weak query language. We then proves that for the databases with only one key the flexible model provides a correct integration of inconsistent data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Logical Framework for Integrating Inconsistent Information in Multiple Databases

When integrating data coming from multiple different sources we are faced with the possibility of inconsistency in databases. In this paper, we use one of the paraconsistent logics introduced in [9, 7] (LFI1) as a logical framework to model possibly inconsistent database instances obtained by integrating different sources. We propose a method based on the sound and complete tableau proof system...

متن کامل

Flexible Relation: An Approach for Integrating Data from Multiple, Possibly Inconsistent Databases

In this work we address the problem of dealing with data inconsistencies while integrating data sets derived from multiple autonomous relational databases. The fundamental assumption in the classical relational model is that data is consistent and hence no support is provided for dealing with inconsistent data. Due to this limitation of the classical relational model, the semantics for detectin...

متن کامل

On the Computational Complexity of Consistent Query Answers

It is nowadays common to build databases integrating information from multiple, autonomous, distributed data sources. The problem of data integration is nevertheless very complex [9, 10]. In this paper, we consider a specific issue arising in data integration; how to obtain reliable, consistent information from inconsistent databases – databases that do not have to satisfy given integrity const...

متن کامل

A paraconsistent logic programming approach for querying inconsistent databases

When integrating data coming from multiple different sources we are faced with the possibility of inconsistency in databases. A paraconsistent approach for knowledge base integration allows keeping inconsistent information and reasoning in its presence. In this paper, we use a paraconsistent logic (LFI1) as the underlying logic for the specification of P-Datalog, a deductive query language for ...

متن کامل

A Paraconsistent Logic Programming Approach for Querying Inconsistent Knowledge Bases

When integrating data coming from multiple different sources we are faced with the possibility of inconsistency in databases. A paraconsistent approach for knowledge base integration allows keeping inconsistent information and reasoning in its presence. In this paper, we use a paraconsistent logic (LFI1) as the underlying logic for the specification of P-Datalog, a deductive query language for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996