Computational Characterisation of Peer-to-Peer Database Systems

Title: Computational Characterisation of Peer-to-Peer Database Systems

Research Question: How can we create a robust logical and computational characterisation of peer-to-peer (p2p) database systems that allows for local inconsistencies and provides efficient query answering?

Methodology: The researchers proposed a model-theoretic semantics for p2p systems that allows for local inconsistencies. They characterised the general computational properties of query answering in these systems and devised tight complexity bounds and distributed procedures for query answering in special cases.

Results: They provided a robust logical and computational characterisation of p2p database systems that allows for local inconsistencies. They also proposed a polynomial-time algorithm for query answering over real-world p2p networks, which does not require knowledge of the network structure and can change dynamically.

Implications: This research has implications for the design and management of p2p database systems. It provides a framework that allows for local inconsistencies, which is a practical requirement in many real-world scenarios. The proposed algorithm for query answering is efficient and can be applied in various p2p systems, making it a valuable tool for data management.

Link to Article: https://arxiv.org/abs/0308013v1 Authors: arXiv ID: 0308013v1