Scientific and Statistical Database Management, International Conference on (2001)
July 18, 2001 to July 20, 2001
Chung-Min Chen , Telcordia Technologies
Rakesh Sinha , Ciena Corp.
Randeep Bhatia , Bell Laboratories
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.
R. Bhatia, R. Sinha and C. Chen, "Efficient Disk Allocation Schemes for Parallel Retrieval of Multidimensional Grid Data," Scientific and Statistical Database Management, International Conference on(SSDBM), Fairfax, Virginia, 2001, pp. 0213.