Parallel relational database algorithms revisited for range declustered data sets

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 pap...

Full description

Saved in:
Bibliographic Details
Published inParallel Architectures, Algorithms and Networks, 1994 International Symposium (ISPAN '94) pp. 25 - 32
Main Author Schikuta, E.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1994
Subjects
Algorithm design and analysis
Computer architecture
Database systems
Disk drives
Hardware
Parallel algorithms
Partitioning algorithms
Performance analysis
Relational databases
Software architecture
Online AccessGet full text
ISBN0818665076
9780818665073
DOI10.1109/ISPAN.1994.367168

Cover

More Information
Summary: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.< >
ISBN:0818665076
9780818665073
DOI:10.1109/ISPAN.1994.367168