A Robust and Computational Characterisation of Peer-to-Peer Database Systems
<|reference_start|>A Robust and Computational Characterisation of Peer-to-Peer Database Systems: 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.<|reference_end|>
@article{franconi2003a,
    title={A Robust and Computational Characterisation of Peer-to-Peer Database
  Systems},
    author={Enrico Franconi, Gabriel Kuper, Andrei Lopatenko, Luciano Serafini},
    journal={"International Workshop On Databases, Information Systems and
  Peer-to-Peer Computing", 2003},
    year={2003},
    archivePrefix={arXiv},
    eprint={cs/0308013},
    primaryClass={cs.DC cs.DB}
}