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

Simple item page
dc.creatorFranconi, Enrico
dc.creatorKuper, Gabriel
dc.creatorLopatenko, Andrei
dc.creatorSerafini, Luciano
dc.date2003-08-06
dc.date.accessioned2026-07-07T03:20:12Z
dc.date.available2026-07-07T03:20:12Z
dc.descriptionIn 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.
dc.description13 pages
dc.identifierhttps://arxiv.org/abs/cs/0308013
dc.identifierhttp://arxiv.org/abs/cs/0308013
dc.identifier"International Workshop On Databases, Information Systems and Peer-to-Peer Computing", 2003
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31742
dc.subjectDistributed, Parallel, and Cluster Computing
dc.subjectDatabases
dc.subjectH.2.4;H.2.5;C.2.4
dc.titleA Robust and Computational Characterisation of Peer-to-Peer Database Systems
dc.typetext

Files

Collections

arXiv