Home | english  | Impressum | Sitemap | KIT

Fault-Tolerant Query Processing for Structured Peer-to-Peer Systems

Fault-Tolerant Query Processing for Structured Peer-to-Peer Systems

Markus Bestehorn, Christian von der Weth, Erik Buchmann, Klemens Böhm



Distributed and Paralell Databases - An International Journal

Datum: 21.04.2010


Recently, a number of query processors has been proposed for the evaluation of relational queries in structured P2P systems. However, as these approaches do not consider peer or link failures, they cannot be deployed without extensions for real-world applications. We show that typical failures in structured P2P systems can have an unpredictable impact on the correctness of the result. In particular stateful operators that store intermediate results on peers, e.g., the distributed hash join, must protect such results against failures. Although many replication schemes for P2P systems exist, they cannot replicate operator states while the query is processed. In this paper we propose an in-query replication scheme which replicates the state of an operator among the neighbors of the processing peer. Our analytical evaluation shows that the network overhead of the in-query replication is in O(1) regarding network size, i.e., our scheme is scalable. We have carried out an extensive experimental evaluation using simulations as well as a PlanetLab deployment. It confirms the effectiveness and the efficiency of the in-query replication scheme and shows the effectiveness of the routing extension in networks of varying reliability.