2011Computer Technology and DevelopmentRequires access

Query Optimization Strategies of Flash Memory Database Based on Column Storage

Mei Chen

Open publisher page 0 citations

Abstract

With flash memory to improve performance and capacity,flash memory database research has been widespread concern.Flash-memory has the characteristic of random read fast and erased characteristics of a large cost.It's an important issues of flash memory database query that how to use flash feature and reduce the frequency of queries written.Many query optimization algorithms have been the main line according to the traditional way.This has limitations.In this paper,column storage,a new connection algorithm is proposed that minimizes the staging table,so that projection data is greatly reduced.It achieves the purpose of less write flash memory and reducing the cost of erasing,so this algorithm improves the query efficiency.A experiment with the comparison of a traditional algorithm proves the superiority of this algorithm.

About this research paper

What this paper is about

With flash memory to improve performance and capacity,flash memory database research has been widespread concern.Flash-memory has the characteristic of random read fast and erased characteristics of a large cost.It's an important issues of flash memory database query that how to use flash feature and reduce the frequency of queries written.Many query optimization algorithms have been the main line according to the traditional way.This has limitations.In this paper,column storage,a new connection algorithm is proposed that minimizes the staging table,so that projection data is greatly reduced.It achieves the purpose of less write flash memory and reducing the cost of erasing,so this algorithm improves the query efficiency.A experiment with the comparison of a traditional algorithm proves the superiority of this algorithm.

Why it matters

A significance statement is not available in the OpenAlex record.

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

With flash memory to improve performance and capacity,flash memory database research has been widespread concern.Flash-memory has the characteristic of random read fast and erased characteristics of a large cost.It's an important issues of flash memory database query that how to use flash feature and reduce the frequency of queries written.Many query optimization algorithms have been the main line according to the traditional way.This has limitations.In this paper,column storage,a new connection algorithm is proposed that minimizes the staging table,so that projection data is greatly reduced.It achieves the purpose of less write flash memory and reducing the cost of erasing,so this algorithm improves the query efficiency.A experiment with the comparison of a traditional algorithm proves the superiority of this algorithm.

Key concepts: Computer science, Flash file system, Flash memory, Flash (photography), Query optimization, Database, Column (typography), Table (database)

Related papers

Back to paper searchBrowse research topicsOriginal source
Query Optimization Strategies of Flash Memory Database Based on Column Storage — Research Paper | ScholarLens