Query Planning in the PORDaS P2P Database System
Kjetil NÃ¸rvÃ¥g, Eirik Eide and Odin Hole Standal
Journal of Digital Information Management, Vol. 6, No. 4, 2008.
DOI: 
Link: http://www.dirf.org/jdim/v6n4a4.asp
Abstract:
Computational science is a rapidly growing multidisciplinary field that has a need for scalable, distributed, and efficient data management. In our research, we see the peer-to-peer (P2P) paradigm a possible solution to some of the problems in distributed data management. 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.