A Robust Logical and Computational Characterisation of Peer-to-Peer Database Systems

In this paper we give a robust logical and computational characterisation of peer-to-peer (p2p) database systems. We first define a precise model-theoretic semantics of a p2p system, which allows for local inconsistency handling. We then characterise the general computational properties for the problem of answering queries to such a p2p system. Finally, we devise tight complexity bounds and distributed procedures for the problem of answering queries in few relevant special cases.

• Type: Conference
• Year: 2003
• Where: DBISP2P
• Authors: Enrico Franconi, Gabriel M. Kuper, Andrei Lopatenko, Luciano Serafini
• Keywords: DBISP2P 2003, P2P System, Precise Model-theoretic Semantics, Tight Complexity Bounds