论文信息 - A Distributed Algorithm for Robust Data Sharing and Updates in P2P Database Networks

A Distributed Algorithm for Robust Data Sharing and Updates in P2P Database Networks

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.

[1] Patrick Brézillon,et al. Modeling and Using Context , 1999, Lecture Notes in Computer Science.

[2] L. Serafini,et al. Using Wrapper Agents to Answer Queries in Distributed Information Systems , 2000, ADVIS.

[3] Fausto Giunchiglia,et al. Data Management for Peer-to-Peer Computing : A Vision , 2002, WebDB.

[4] Tatyana Yakhno,et al. Advances in Information Systems , 2002, Lecture Notes in Computer Science.

[5] Eric Zimmerman. CRIS-Cross : Current Research Information Systems at a Crossroads , 2002 .

[6] Fausto Giunchiglia,et al. Local Relational Model: A Logical Formalization of Database Coordination , 2003, CONTEXT.

[7] Diego Calvanese,et al. Semantic Data Integration in P2P Systems , 2003, DBISP2P.

[8] Hector Garcia-Molina,et al. Open Problems in Data-Sharing Peer-to-Peer Systems , 2003, ICDT.

[9] Gabriel M. Kuper,et al. Structural Properties of XPath Fragments , 2003, ICDT.

[10] Joseph M. Hellerstein,et al. Toward network data independence , 2003, SGMD.

[11] Fausto Giunchiglia,et al. Implementing Database Coordination in P2P Networks , 2003 .

[12] Gabriel M. Kuper,et al. A Robust Logical and Computational Characterisation of Peer-to-Peer Database Systems , 2003, DBISP2P.

[13] Ronald Fagin,et al. Data exchange: semantics and query answering , 2003, Theor. Comput. Sci..