Data management over flash memory
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Log-compact R-tree: an efficient spatial index for SSD
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
Hybrid hash index for NAND flash memory-based storage systems
Proceedings of the 6th International Conference on Ubiquitous Information Management and Communication
Adapting the b+-tree for asymmetric i/o
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
| Hi-index | 0.00 |
Compared with traditional magnetic disks, Flash memory has many advantages and has been used as external storage media for a wide spectrum of electronic devices (such as PDA, MP3, Digital Camera and Mobile Phone) in recent years. As the capacity increases and price drops, it looks like a perfect alternative for magnetic disks. However, due to hardware limitations of flash memory, techniques including storage subsystem and indexing originally designed for magnetic disks can not run smoothly in a flash memory without any modification. In this paper we explore problems of indexing flash-resided data and present a new dynamical hash index for flash memory in two schemas. The analysis and experimental results validate the efficiency of our design.