Information Sciences: an International Journal
Proceedings of the 2007 ACM symposium on Applied computing
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)
Threshold based declustering in high dimensions
DEXA'05 Proceedings of the 16th international conference on Database and Expert Systems Applications
Generalized Optimal Response Time Retrieval of Replicated Data from Storage Arrays
ACM Transactions on Storage (TOS)
| Hi-index | 0.00 |
Declustering techniques reduce query response times through parallel I/O by distributing data among multiple devices.Most of the research on declustering is targeted at spatial range queries and investigates scheme with low additive error.Recently, declustering using replication is proposed to reduce the additive overhead.Replication significantly reduces retrieval cost of arbitrary queries.In this paper, we propose a disk allocation and retrieval mechanism for arbitrary queries based on design theory.Using proposed c-copy replicated declustering scheme, (c - 1)k^2 + ck buckets can be retrieved using at most k disk accesses. Retrieval algorithm is very efficient and is asymptotically optimal with 驴(|Q|) complexity for a query Q. In addition to the deterministic worst-case bound and efficient retrieval, proposed algorithm handles nonuniform data, high dimensions, supports incremental declustering and has good fault-tolerance property.