Efficient Disk Allocation Schemes for Parallel Retrieval of Multidimensional Grid Data

Authors:
Chung-Min Chen;Rakesh Sinha;Randeep Bhatia
Affiliations:
-;-;-
Venue:
SSDBM '01 Proceedings of the 13th International Conference on Scientific and Statistical Database Management
Year:
2001

Citing 0
Cited 5

From discrepancy to declustering: near-optimal multidimensional declustering strategies for range queries

Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Asymptotically optimal declustering schemes for 2-dim range queries

Theoretical Computer Science - Database theory
Replication and retrieval strategies of multidimensional data on parallel disks

CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
From discrepancy to declustering: Near-optimal multidimensional declustering strategies for range queries

Journal of the ACM (JACM)
Distributed processing of large biomedical 3d images

VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: Declustering schemes enable parallel data retrieval by placing data blocks across multiple disk devices. Various declustering schemes have been proposed for multidimensional data to reduce response time of range queries. However, efficient schemes, which must be easy to compute and provide good performance, are only known for a restricted number of disks and dimensions. In this paper, we propose a novel technique to construct efficient multidimensional declustering schemes, for any number of disks and dimensions. Simulation results show that the new schemes outperform previously known best, non-exhaustive-search-based multidimensional declustering schemes.