Parallel free-text search on the connection machine system
Communications of the ACM - Special issue on parallelism
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A case for redundant arrays of inexpensive disks (RAID)
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Disk allocation for Cartesian product files on multiple-disk systems
ACM Transactions on Database Systems (TODS)
Optimal partial-match retrieval when fields are independently specified
ACM Transactions on Database Systems (TODS)
Parallel searching for binary Cartesian product files
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
Attribute based file organization in a paged memory environment
Communications of the ACM
GAMMA - A High Performance Dataflow Database Machine
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
The Idea of De-Clustering and its Applications
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
Declustering of key-based partitioned signature files
ACM Transactions on Database Systems (TODS)
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
GeMDA: A Multidimensional Data Partitioning Technique for Multiprocessor Database Systems
Distributed and Parallel Databases
Nearest Neighbor Queries in Shared-Nothing Environments
Geoinformatica
A Hypergraph Based Approach to Declustering Problems
Distributed and Parallel Databases
Optimal Bucket Allocation Design of k-ary MKH Files for Partial Match Retrieval
IEEE Transactions on Knowledge and Data Engineering
Scalability Analysis of Declustering Methods for Multidimensional Range Queries
IEEE Transactions on Knowledge and Data Engineering
Declustering and Load-Balancing Methods for Parallelizing Geographic Information Systems
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Parallel and Distributed Systems
Declustering Objects for Visualization
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
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
Data partitioning and load balancing in parallel disk systems
The VLDB Journal — The International Journal on Very Large Data Bases
Data and knowledge in database systems: parallel databases
Handbook of data mining and knowledge discovery
A study on grid partition for declustering high-dimensional data
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
| Hi-index | 14.98 |
The problem of declustering, that is, how to distribute a binary Cartesian product file on multiple disks to maximize the parallelism for partial match queries, is examined. Cartesian product files appear as a result of some secondary key access methods. For the binary case, the problem is reduced to grouping the 2/sup n/ binary strings on n bits in m groups of unsimilar strings. It is proposed that the strings be grouped such that these group forms an error correcting code (ECC). This construction guarantees that the strings of a given group will have large Hamming distances, i.e., they will differ in many bit positions. Intuitively, this should result in good declustering. The authors describe how to build a declustering scheme using an ECC, and prove a theorem that gives a necessary condition for the proposed method to be optimal. Analytical results show that the proposed method is superior to older heuristics, and that it is very close to the theoretical (nontight) bound.