Query Planning in the PORDaS P2P Database System
Kjetil Nørvåg, Eirik Eide, Odin Hole Standal · Journal of Digital Information Management · 2008
Computational science is a rapidly grow- ing multidisciplinary field that has a need for scalable, distributed, and efficient data management. In our re- search, we see the peer-to-peer (P2P) paradigm a pos- sible solution to some of the problems in distributed data management. P2P has already proved to be suit- able in contexts like file sharing, distributed computa- tions, 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.