A Robust and Computational Characterisation of Peer-to-Peer Database Systems
Distributed, Parallel, and Cluster Computing
2007-05-23 v1 Databases
Abstract
In this paper we give a robust logical and computational characterisation of peer-to-peer database systems. We first define a pre- cise model-theoretic semantics of a peer-to-peer system, which allows for local inconsistency handling. We then characterise the general computa- tional properties for the problem of answering queries to such a peer-to- peer system. Finally, we devise tight complexity bounds and distributed procedures for the problem of answering queries in few relevant special cases.
Cite
@article{arxiv.cs/0308013,
title = {A Robust and Computational Characterisation of Peer-to-Peer Database Systems},
author = {Enrico Franconi and Gabriel Kuper and Andrei Lopatenko and Luciano Serafini},
journal= {arXiv preprint arXiv:cs/0308013},
year = {2007}
}
Comments
13 pages