Multi-Level Bitmap Indexes for Flash Memory Storage

Conference · Fri Jul 23 04:00:00 EDT 2010

OSTI ID:1004601

Wu, Kesheng; Madduri, Kamesh; Canon, Shane

Due to their low access latency, high read speed, and power-efficient operation, flash memory storage devices are rapidly emerging as an attractive alternative to traditional magnetic storage devices. However, tests show that the most efficient indexing methods are not able to take advantage of the flash memory storage devices. In this paper, we present a set of multi-level bitmap indexes that can effectively take advantage of flash storage devices. These indexing methods use coarsely binned indexes to answer queries approximately, and then use finely binned indexes to refine the answers. Our new methods read significantly lower volumes of data at the expense of an increased disk access count, thus taking full advantage of the improved read speed and low access latency of flash devices. To demonstrate the advantage of these new indexes, we measure their performance on a number of storage systems using a standard data warehousing benchmark called the Set Query Benchmark. We observe that multi-level strategies on flash drives are up to 3 times faster than traditional indexing strategies on magnetic disk drives.

• Research Organization: Ernest Orlando Lawrence Berkeley National Laboratory, Berkeley, CA (US)
• Sponsoring Organization: Computational Research Division; National Energy Research Scientific Computing Division
• DOE Contract Number: AC02-05CH11231
• OSTI ID: 1004601
• Report Number(s): LBNL-4217E
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING
BENCHMARKS
Data Management
bitmap index
flash memory
MAGNETIC DISKS
MAGNETIC STORAGE DEVICES
PERFORMANCE
STORAGE
VELOCITY