Optimal file distribution for partial match retrieval
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Declustering using error correcting codes
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The design and analysis of spatial data structures
The design and analysis of spatial data structures
The R*-tree: an efficient and robust access method for points and rectangles
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A performance analysis of alternative multi-attribute declustering strategies
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Partitioning similarity graphs: a framework for declustering problems
Information Systems
Fast parallel similarity search in multimedia databases
SIGMOD '97 Proceedings of the 1997 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
Multidimensional access methods
ACM Computing Surveys (CSUR)
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
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A Hypergraph Based Approach to Declustering Problems
Distributed and Parallel Databases
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
Hybrid-Range Partitioning Strategy: A New Declustering Strategy for Multiprocessor Database Machines
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Parity Striping of Disk Arrays: Low-Cost Reliable Storage with Acceptable Throughput
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
CMD: A Multidimensional Declustering Method for Parallel Data Systems
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Dynamic Declustering Methods for Parallel Grid Files
Proceedings of the Third International ACPC Conference with Special Emphasis on Parallel Databases and Parallel I/O: Parallel Computation
Optimal Parallel I/O for Range Queries through Replication
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
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
Optimal Parallel I/O Using Replication
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
Replication and retrieval strategies of multidimensional data on parallel disks
CIKM '03 Proceedings of the twelfth international conference on Information and knowledge management
Replicated declustering for arbitrary queries
Proceedings of the 2004 ACM symposium on Applied computing
Iterative-improvement-based declustering heuristics for multi-disk databases
Information Systems
Replicated declustering of spatial data
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Design Theoretic Approach to Replicated Declustering
ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01
Efficient retrieval of replicated data
Distributed and Parallel Databases
Efficient parallel processing of range queries through replicated declustering
Distributed and Parallel Databases
Optimal distributed declustering using replication
ICDT'05 Proceedings of the 10th international conference on Database Theory
Certificateless threshold cryptosystem secure against chosen-ciphertext attack
Information Sciences: an International Journal
Selective Replicated Declustering for Arbitrary Queries
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Divide-and-conquer scheme for strictly optimal retrieval of range queries
ACM Transactions on Storage (TOS)
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Toward boosting distributed association rule mining by data de-clustering
Information Sciences: an International Journal
Generalized Optimal Response Time Retrieval of Replicated Data from Storage Arrays
ACM Transactions on Storage (TOS)
Hi-index | 0.07 |
Declustering techniques reduce query response time through parallel I/O by distributing data among multiple devices. Except for a few cases it is not possible to find declustering schemes that are optimal for all spatial range queries. As a result of this, most of the research on declustering has focused on finding schemes with low worst case additive error. However, additive error based schemes have many limitations including lack of progressive guarantees and existence of small non-optimal queries. In this paper, we take a different approach and propose threshold-based declustering. We investigate the threshold k such that all spatial range queries with =