Declustering Two-Dimensional Datasets over MEMS-Based Storage

Due to the large difference between seek time and transfer time in current disk technology, it is advantageous to perform large I/O using a single sequential access rather than multiple small random I/O accesses. However, prior optimal cost and data placement approaches for processing range queries over two-dimensional datasets do not consider this property. In particular, these techniques do not consider the issue of sequential data placement when multiple I/O blocks need to be retrieved from a single device. In this paper, we reevaluate the optimal cost of range queries, and prove that, in general, it is impossible to achieve the new optimal cost. This is because disks cannot facilitate two-dimensional sequential access which is required by the new optimal cost. Fortunately, MEMS-based storage is being developed to reduce I/O cost. We first show that the two-dimensional sequential access requirement can not be satisfied by simply modeling MEMS-based storage as conventional disks. Th...

• Type: Conference
• Year: 2004
• Where: EDBT
• Authors: Hailing Yu, Divyakant Agrawal, Amr El Abbadi
• Keywords: Database, EDBT 2004, MEMS-based Storage, Sequential Data Placement, Two-dimensional Sequential Access