Query planning in P2P database systems

Abstract

The peer-to-peer (P2P) paradigm is emerging as a possible solution to some of the problems in distributed data processing, including scalability, availability, and administrative cost. P2P has already proved to be suitable in contexts like file sharing, distributed computations, and distributed search. In our research we are aiming at using P2P to solve some problems in the domain of distributed databases. In this paper we 1) present PORDaS, a distributed DBMS based on P2P techniques, 2) describe query processing and query planning in PORDaS, and 3) present results from an experimental evaluation of different query planning variants.