Optimal file distribution for partial match retrieval
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Fast parallel similarity search in multimedia databases
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
A case for intelligent disks (IDISKs)
ACM SIGMOD Record
Disk allocation for Cartesian product files on multiple-disk systems
ACM Transactions on Database Systems (TODS)
(Almost) optimal parallel block access to range queries
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PDIS '93 Proceedings of the second international conference on Parallel and distributed information systems
Titan: A High-Performance Remote Sensing Database
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Cyclic Allocation of Two-Dimensional Data
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Optimal Allocation of Two-Dimensional Data
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Study of Scalable Declustering Algorithms for Parallel Grid Files
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Declustering Objects for Visualization
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Hierarchical Declustering Schemes for Range Queries
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Efficient Retrieval of Multidimensional Datasets through Parallel I/O
HIPC '98 Proceedings of the Fifth International Conference on High Performance Computing
Concentric Hyperspaces and Disk Allocation for Fast Parallel Range Searching
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Raster-Spatial Data Declustering Revisited: an Interactive Navigation Perspective
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Declustering Using Golden Ratio Sequences
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
New GDM-Based Declustering Methods for Parallel Range Queries
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Optimal Parallel I/O for Range Queries through Replication
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
IEEE Transactions on Knowledge and Data Engineering
Optimal distributed declustering using replication
ICDT'05 Proceedings of the 10th international conference on Database Theory
| Hi-index | 0.00 |
Declustering techniques have been widely adopted in parallel storage systems (e.g. disk arrays) to speed up bulk retrieval of multidimensional data. A declustering scheme distributes data items among multiple devices, thus enabling parallel I/O access and reducing query response time. We measure the performance of any declustering scheme as its worst case additive deviation from the ideal scheme. The goal thus is to design declustering schemes with as small an additive error as possible. We describe a number of declustering schemes with additive error O(log M) for 2-dimensional range queries, where M is the number of disks. These are the first results giving such a strong bound for any value of M. Our second result is a lower bound on the additive error. In 1997, Abdel-Ghaffar and Abbadi showed that except for a few stringent cases, additive error of any 2-dim declustering scheme is at least one. We strengthen this lower bound to Ω((log M)d-1/2 for d-dim schemes and to Ω(log M) for 2-dim schemes, thus proving that the 2-dim schemes described in this paper are (asymptotically) optimal. These results are obtained by establishing a connection to geometric discrepancy, a widely studied area of mathematics. We also present simulation results to evaluate the performance of these schemes in practice.