Data structures for dynamic queries: an analytical and experimental evaluation
AVI '94 Proceedings of the workshop on Advanced visual interfaces
Parallel processing of nearest neighbor queries in declustered spatial data
GIS '96 Proceedings of the 4th ACM international workshop on Advances in geographic information systems
Dynamic Data Reallocation for Skew Management inShared-Nothing Parallel Databases
Distributed and Parallel Databases
The pyramid-technique: towards breaking the curse of dimensionality
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Efficient disk allocation for fast similarity searching
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Efficient input and output for scientific simulations
Proceedings of the sixth workshop on I/O in parallel and distributed systems
Clustering declustered data for efficient retrieval
Proceedings of the eighth international conference on Information and knowledge management
Querying very large multi-dimensional datasets in ADR
SC '99 Proceedings of the 1999 ACM/IEEE conference on Supercomputing
(Almost) optimal parallel block access to range queries
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
GeMDA: A Multidimensional Data Partitioning Technique for Multiprocessor Database Systems
Distributed and Parallel Databases
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient declustering techniques for temporal access structures
ADC '01 Proceedings of the 12th Australasian database conference
Nearest Neighbor Queries in Shared-Nothing Environments
Geoinformatica
Processing large-scale multi-dimensional data in parallel and distributed environments
Parallel Computing - Parallel data-intensive algorithms and applications
Scalability Analysis of Declustering Methods for Multidimensional Range Queries
IEEE Transactions on Knowledge and Data Engineering
Analysis and Comparison of Declustering Schemes for Interactive Navigation Queries
IEEE Transactions on Knowledge and Data Engineering
Asymptotically Optimal Declustering Schemes for Range Queries
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Study of Scalable Declustering Algorithms for Parallel Grid Files
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Efficient Manipulation of Large Datasets on Heterogeneous Storage Systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Declustering Databases on Heterogeneous Disk Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Declustering Spatial Objects by Clustering for Parallel Disks
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Optimal Parallel I/O for Range Queries through Replication
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Hierarchical Declustering Schemes for Range Queries
EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Data placement in shared-nothing parallel database systems
The VLDB Journal — The International Journal on Very Large Data Bases
Multidimensional Declustering Schemes Using Golden Ratio and Kronecker Sequences
IEEE Transactions on Knowledge and Data Engineering
Data and knowledge in database systems: parallel databases
Handbook of data mining and knowledge discovery
Asymptotically optimal declustering schemes for 2-dim range queries
Theoretical Computer Science - Database theory
New GDM-Based Declustering Methods for Parallel Range Queries
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
Disk Allocation for Fast Range and Nearest-Neighbor Queries
Distributed and Parallel Databases
(Almost) Optimal parallel block access for range queries
Information Sciences—Informatics and Computer Science: An International Journal
One torus to rule them all: multi-dimensional queries in P2P systems
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
On efficiently processing nearest neighbor queries in a loosely coupled set of data sources
Proceedings of the 12th annual ACM international workshop on Geographic information systems
Iterative-improvement-based declustering heuristics for multi-disk databases
Information Systems
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Optimizing Reduction Computations In a Distributed Environment
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Replicated declustering of spatial data
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Optimal data-space partitioning of spatial data for parallel I/O
Distributed and Parallel Databases
Design of a next generation sampling service for large scale data analysis applications
Proceedings of the 19th annual international conference on Supercomputing
Efficient retrieval of replicated data
Distributed and Parallel Databases
Exploiting sequential access when declustering data over disks and MEMS-based storage
Distributed and Parallel Databases
Efficient parallel processing of range queries through replicated declustering
Distributed and Parallel Databases
Improved bounds and schemes for the declustering problem
Theoretical Computer Science
Data space mapping for efficient I/O in large multi-dimensional databases
Information Systems
Information Sciences: an International Journal
Proceedings of the 2005 conference on Software Engineering: Evolution and Emerging Technologies
Divide-and-conquer scheme for strictly optimal retrieval of range queries
ACM Transactions on Storage (TOS)
Irregularity in high-dimensional space-filling curves
Distributed and Parallel Databases
A study on grid partition for declustering high-dimensional data
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
Online balancing of ar-tree indexed distributed spatial data warehouse
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Generalized Optimal Response Time Retrieval of Replicated Data from Storage Arrays
ACM Transactions on Storage (TOS)
| Hi-index | 0.00 |
We propose a method to achieve declustering for cartesian product files on M units. The focus is on range queries, as opposed to partial match queries that older declustering methods have examined. Our method uses a distance-preserving mapping, namely, the Hilbert curve, to impose a linear ordering on the multidimensional points (buckets); then, it traverses the buckets according to this ordering, assigning buckets to disks in a round-robin fashion. Thanks to the good distance-preserving properties of the Hilbert curve, the end result is that each disk contains buckets that are far away in the K-d address space. This is exactly the goal of declustering. Experiments show that these intuitive arguments lead indeed to good performance: the proposed method performs at least as well or better than older declustering schemes.