By Topic

Parallel relational database algorithms revisited for range declustered data sets

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

1 Author(s)
Schikuta, E. ; Dept. of Data Eng., Wien Univ., Austria

Today available parallel database systems use conventional parallel hardware architectures employing a highly parallel software architecture. It is an emerging technique to speed up the execution by declustering the stored data sets among a number of parallel and independent disk drives. In this paper we revisit parallel relational database algorithms for range declustering. We adapt the conventional known and well studied parallel algorithms for declustered data, exploit the inherent order property of the partitioned data sets and compare analytically the performance of the algorithms. It is shown that the parallel range declustered variants generally outperform their conventional parallel counterparts

Published in:

Parallel Architectures, Algorithms and Networks, 1994. (ISPAN), International Symposium on

Date of Conference:

14-16 Dec 1994