A distributed algorithm for robust data sharing and updates in p2p database networks

Authors:
Enrico Franconi;Gabriel Kuper;Andrei Lopatenko;Ilya Zaihrayeu
Affiliations:
Faculty of Computer Science, Free University of Bozen–Bolzano, Italy;University of Trento, DIT, Italy;Faculty of Computer Science, Free University of Bozen–Bolzano, Italy;University of Trento, DIT, Italy
Venue:
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Year:
2004

Citing 5
Cited 4

Data Exchange: Semantics and Query Answering

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Open Problems in Data-Sharing Peer-to-Peer Systems

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Using Wrapper Agents to Answer Queries in Distributed Information Systems

ADVIS '00 Proceedings of the First International Conference on Advances in Information Systems
Toward network data independence

ACM SIGMOD Record
Local relational model: a logical formalization of database coordination

CONTEXT'03 Proceedings of the 4th international and interdisciplinary conference on Modeling and using context

On the complexity of computing peer agreements for consistent query answering in peer-to-peer data integration systems

Proceedings of the 14th ACM international conference on Information and knowledge management
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
Resource-Aware Update Policy for Highly Dynamic P2P Networks

WI-IATW '07 Proceedings of the 2007 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops
The semantics of consistency and trust in peer data exchange systems

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we thoroughly analyze a distributed procedure for the problem of local database update in a network of database peers, useful for data exchange scenarios The algorithm supports dynamic networks: even if nodes and coordination rules appear or disappear during the computation, the proposed algorithm will eventually terminate with a sound and complete result.