Optimal file distribution for partial match retrieval
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
IEEE Spectrum
On GDM allocation method for partial range queries
Information Systems
Partitioning similarity graphs: a framework for declustering problems
Information Systems
A case for intelligent disks (IDISKs)
ACM SIGMOD Record
Visually exploring gigabyte data sets in real time
Communications of the ACM
Disk allocation for Cartesian product files on multiple-disk systems
ACM Transactions on Database Systems (TODS)
Expected Length of the Longest Probe Sequence in Hash Code Searching
Journal of the ACM (JACM)
Microsoft TerraServer: a spatial data warehouse
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
PDIS '93 Proceedings of the second international conference on Parallel and distributed information systems
Remote Sensing: Digital Image Analysis
Remote Sensing: Digital Image Analysis
Scalability Analysis of Declustering Methods for Multidimensional Range Queries
IEEE Transactions on Knowledge and Data Engineering
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
Study of Scalable Declustering Algorithms for Parallel Grid Files
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
The Idea of De-Clustering and its Applications
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Declustering Objects for Visualization
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
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
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
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Hierarchical data placement for navigational multimedia applications
Data & Knowledge Engineering
Multidimensional Declustering Schemes Using Golden Ratio and Kronecker Sequences
IEEE Transactions on Knowledge and Data Engineering
Asymptotically optimal declustering schemes for 2-dim range queries
Theoretical Computer Science - Database theory
A simulated annealing approach for multimedia data placement
Journal of Systems and Software
| Hi-index | 0.00 |
Declustering schemes enable parallel retrievals of raster-spatial data by allocating data among multiple disks. Previous work in the literature has focused on static range queries. In this paper, we focus on interactive navigation queries, which exhibit a new class of data access patterns. We analyze and compare the performance of previously known declustering schemes from the perspective of navigation queries. These schemes include a class of latin-square-based schemes, Disk Modulo, Fieldwise Exclusive-OR, Hilbert Curve Allocation Method, and a random assignment scheme. We show that, unlike the case of range queries, disk modulo outperforms other schemes and gives nearly optimal performance for navigation queries. In addition, we propose a new scheme under the constraint of bounded window size驴a common constraint in practice due to resource limitation such as monitor resolution or memory size. Through extensive analysis, we establish guidelines on how these schemes can be tuned to provide guaranteed performance under the constraint of bounded window size.