Replicated Declustering of Spatial Data

The problem of disk declustering is to distribute data among multiple disks to reduce query response times through parallel I/O. A strictly optimal declustering technique is one that achieves optimal parallel I/O for all possible queries. In this paper, we focus on techniques that are optimized for spatial range queries. Current declustering techniques, which have single copies of the data, have been shown to be suboptimal for range queries. The lower bound on extra disk accesses is proved to be (log N) for N disks even in the restricted case of an N-by-N grid, and all current approaches have been trying to achieve this bound. Replication is a well-known and effective solution for several problems in databases, especially for availability and load balancing. In this paper, we explore the idea of replication in the context of declustering and propose a framework where strictly optimal parallel I/O is achievable using a small amount of replication. We provide some theoretical foundation...

• Type: Conference
• Year: 2004
• Where: PODS
• Authors: Hakan Ferhatosmanoglu, Aravind Ramachandran, Ali Saman Tosun
• Keywords: Database, Optimal Disk Access, Optimal Disk Allocation, Optimal Parallel I/o, PODS 2004