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.
A Robust Logical and Computational Characterisation of Peer-to-Peer Database Systems / Franconi, Enrico; Kuper, Gabriel; Serafini, Luciano; Lopatenko, Andrei. - ELETTRONICO. - (2003).
A Robust Logical and Computational Characterisation of Peer-to-Peer Database Systems
Kuper, Gabriel;Serafini, Luciano;
2003-01-01
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.| File | Dimensione | Formato | |
|---|---|---|---|
|
51.pdf
accesso aperto
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
243.31 kB
Formato
Adobe PDF
|
243.31 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
