DocumentCode :
470067
Title :
Query planning in P2P database systems
Author :
Norvag, K. ; Eide, Eirik ; Standal, Odin Hole
Author_Institution :
Dept. of Comput. Sci., Norwegian Univ. of Sci. & Technol., Trondheim
Volume :
1
fYear :
2007
fDate :
28-31 Oct. 2007
Firstpage :
376
Lastpage :
381
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.
Keywords :
distributed databases; peer-to-peer computing; query processing; P2P; PORDaS; distributed computations; distributed data processing; distributed databases; distributed search; file sharing; query planning; query processing; Costs; Data models; Data processing; Database systems; Distributed computing; Distributed databases; Peer to peer computing; Process planning; Query processing; Scalability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Digital Information Management, 2007. ICDIM '07. 2nd International Conference on
Conference_Location :
Lyon
Print_ISBN :
978-1-4244-1475-8
Electronic_ISBN :
978-1-4244-1476-5
Type :
conf
DOI :
10.1109/ICDIM.2007.4444252
Filename :
4444252
Link To Document :
بازگشت