By Topic

Dynamic out of core join processing in symmetric multiprocessors

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
$33 $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

5 Author(s)
J. Aguilar-Saborit ; Dept. of Comput. Archit., Univ. Politecnica de Catalunya, Barcelona, Spain ; V. Muntes-Mulero ; C. Zuzarte ; A. Zubiri
more authors

The use of clusters of symmetric multiprocessor (SMP) configurations in database processing has become a key factor in allowing greater scalability. It has also posed many challenges in the implementation of one of the most costly operations within relational algebra: the join operation. When massive data is involved, usually the join cannot be performed in-memory and is processed out of core. In this case, performance depends on an effective use of the memory hierarchy, such that I/O and memory contention are minimized. In this paper, we propose a parallel algorithm for out of core join processing that dynamically adapts its behavior to the resources available in the system. We evaluate and compare our proposal against other parallel approaches in a real SMP cluster in a major commercial database, the IBM® DB2P Universal Database7 product (DB2 UDB). Results show that our proposal outperforms previous work significantly.

Published in:

14th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP'06)

Date of Conference:

15-17 Feb. 2006