Referenced Items are not available for this document.
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
- Page(s):
- 25 - 32
- Meeting Date :
- 14 Dec 1994-16 Dec 1994
- Print ISBN:
- 0-8186-6507-6
- INSPEC Accession Number:
- 4864975
- Conference Location :
- Kanazawa
- Digital Object Identifier :
- 10.1109/ISPAN.1994.367168
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
