2009Unpublished venueRequires access

Flash-DBSim: A simulation tool for evaluating Flash-based database algorithms

Xuan Su, Peiquan Jin, Xiaoyan Xiang, Kai Cui, Lihua Yue

Open publisher page 24 citations

Abstract

Flash memory is becoming an attractive alternative to traditional hard disks, because of its small-size, shock-resistant, power-economic, and non-volatile natures. In order to utilize the special I/O properties of flash disks, a lot of new database technologies have been proposed. However, it comes to be a critical problem that researchers are difficult to evaluate their algorithms on current DBMS. People usually have to design and implement different simulating tools to verify the new algorithms on flash disks, and this brings much hard and redundant work. In this paper, we aim at providing a common simulating tool for the evaluation of new algorithms on flash disks. The new tool, named Flash-DBSim, is designed to be reusable and flexible for other researchers to reduce their redundant work. After a brief introduction on the architecture of Flash-DBSim, we present the implemental details of Flash-DBSim. Then, we give a sample use of Flash-DBSim, which aims at evaluating the B+ tree and linear hash index on flash disks. The results show that Flash-DBSim is easy to reconfigure to evaluate the I/O performance of algorithms on flash disks.

About this research paper

What this paper is about

Flash memory is becoming an attractive alternative to traditional hard disks, because of its small-size, shock-resistant, power-economic, and non-volatile natures. In order to utilize the special I/O properties of flash disks, a lot of new database technologies have been proposed. However, it comes to be a critical problem that researchers are difficult to evaluate their algorithms on current DBMS. People usually have to design and implement different simulating tools to verify the new algorithms on flash disks, and this brings much hard and redundant work. In this paper, we aim at providing a common simulating tool for the evaluation of new algorithms on flash disks. The new tool, named Flash-DBSim, is designed to be reusable and flexible for other researchers to reduce their redundant work. After a brief introduction on the architecture of Flash-DBSim, we present the implemental details of Flash-DBSim. Then, we give a sample use of Flash-DBSim, which aims at evaluating the B+ tree and linear hash index on flash disks. The results show that Flash-DBSim is easy to reconfigure to evaluate the I/O performance of algorithms on flash disks.

Why it matters

OpenAlex reports 24 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Flash memory is becoming an attractive alternative to traditional hard disks, because of its small-size, shock-resistant, power-economic, and non-volatile natures. In order to utilize the special I/O properties of flash disks, a lot of new database technologies have been proposed. However, it comes to be a critical problem that researchers are difficult to evaluate their algorithms on current DBMS. People usually have to design and implement different simulating tools to verify the new algorithms on flash disks, and this brings much hard and redundant work. In this paper, we aim at providing a common simulating tool for the evaluation of new algorithms on flash disks. The new tool, named Flash-DBSim, is designed to be reusable and flexible for other researchers to reduce their redundant work. After a brief introduction on the architecture of Flash-DBSim, we present the implemental details of Flash-DBSim. Then, we give a sample use of Flash-DBSim, which aims at evaluating the B+ tree and linear hash index on flash disks. The results show that Flash-DBSim is easy to reconfigure to evaluate the I/O performance of algorithms on flash disks.

Key concepts: Flash (photography), Computer science, Flash file system, Flash memory emulator, Flash memory, Hash function, Database, Algorithm

Related papers

Back to paper searchBrowse research topicsOriginal source
Flash-DBSim: A simulation tool for evaluating Flash-based database algorithms — Research Paper | ScholarLens