A formal model of crash recovery in a distributed system
Concurrency control and reliability in distributed systems
Query evaluation techniques for large databases
ACM Computing Surveys (CSUR)
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Dataflow query execution in a parallel main-memory environment
PDIS '91 Proceedings of the first international conference on Parallel and distributed information systems
Partial Answers for Unavailable Data Sources
FQAS '98 Proceedings of the Third International Conference on Flexible Query Answering Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Application-Level Multicast Using Content-Addressable Networks
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Scalable, Efficient Range Queries for Grid Information Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
Adaptive Replication in Peer-to-Peer Systems
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
An Adaptive Protocol for Efficient Support of Range Queries in DHT-Based Systems
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Fault-Tolerance in Distributed Query Processing
IDEAS '05 Proceedings of the 9th International Database Engineering & Application Symposium
Best Effort Query Processing in DHT-based P2P Systems
ICDEW '05 Proceedings of the 21st International Conference on Data Engineering Workshops
Building resilient low-diameter peer-to-peer topologies
Computer Networks: The International Journal of Computer and Telecommunications Networking
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
PROQID: partial restarts of queries in distributed databases
Proceedings of the 17th ACM conference on Information and knowledge management
DHTJoin: processing continuous join queries using DHT networks
Distributed and Parallel Databases
Replication, load balancing and efficient range query processing in DHTs
EDBT'06 Proceedings of the 10th international conference on Advances in Database Technology
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.