A robust logical and computational characterisation of peer-to-peer database systems
International Workshop on Databases, Information Systems, and Peer-to-Peer …, 2003•Springer
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.
(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.
Abstract
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.
Springer