By Topic

Improving Performance of Declarative Query Execution in DHT-Based Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Arnedo, M. ; Dept. of Syst. & Comput. Eng., Univ. de los Andes, Bogota, Colombia ; del Pilar Villamil, M. ; Villanueva, R.

Peer-to-peer systems based on Distributed Hash Tables face tradeoffs between the performance (latency or availability) and their desired functionality. In fact, lookup latency is affected by the mismatch problem between the overlay hop and the underlying topology. So, applications built on top of such systems can be impacted. A core problem in peer-to-peer systems is the distribution of items to be stored or computations to be carried out by peers in the system. Many works have been done concerning storage and key distribution but little work has been done regarding the distribution of operations carried out by peers in the system. This paper presents a query execution load balancing strategy that allows improving performance of declarative query execution in P2P DHT-based systems. A performance evaluation, using Grid5000 platform, is provided to verify the improvement achieved by the strategies presented.

Published in:

Internet and Web Applications and Services (ICIW), 2010 Fifth International Conference on

Date of Conference:

9-15 May 2010