Consistent query answers in inconsistent databases
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Consistent Answers from Integrated Data Sources
FQAS '02 Proceedings of the 5th International Conference on Flexible Query Answering Systems
A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases
Proceedings of the 17th International Conference on Logic Programming
On the decidability and complexity of query answering over inconsistent and incomplete databases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Piazza: data management infrastructure for semantic web applications
WWW '03 Proceedings of the 12th international conference on World Wide Web
Efficient query reformulation in peer data management systems
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Logical foundations of peer-to-peer data integration
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The INFOMIX system for advanced integration of incomplete and inconsistent data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Queries and updates in the coDB peer to peer database system
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Logic programs for consistently querying data integration systems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Query rewriting and answering under constraints in data integration systems
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Local relational model: a logical formalization of database coordination
CONTEXT'03 Proceedings of the 4th international and interdisciplinary conference on Modeling and using context
A distributed algorithm for robust data sharing and updates in p2p database networks
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Query answering in peer-to-peer data exchange systems
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Solving abduction by computing joint explanations
Annals of Mathematics and Artificial Intelligence
ICDT'07 Proceedings of the 11th international conference on Database Theory
FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Hi-index | 0.00 |
Peer-to-Peer (P2P) data integration systems have recently attracted significant attention for their ability to manage and share data dispersed over different peer sources. While integrating data for answering user queries, it often happens that inconsistencies arise, because some integrity constraints specified on peers' global schemas may be violated. In these cases, we may give semantics to the inconsistent system by suitably "repairing" the retrieved data, as typically done in the context of traditional data integration systems. However, some specific features of P2P systems, such as peer autonomy and peer preferences (e.g., different source trusting), should be properly addressed to make the whole approach effective. In this paper, we face these issues that were only marginally considered in the literature. We first present a formal framework for reasoning about autonomous peers that exploit individual preference criteria in repairing the data. The idea is that queries should be answered over the best possible database repairs with respect to the preferences of all peers, i.e., the states on which they are able to find an agreement. Then, we investigate the computational complexity of dealing with peer agreements and of answering queries in P2P data integration systems. It turns out that considering peer preferences makes these problems only mildly harder than in traditional data integration systems.