2007
DOI: 10.1177/0165551506076331
|View full text |Cite
|
Sign up to set email alerts
|

An index rewriting scheme using compression for flash memory database systems

Abstract: Flash memories are one of the best media to support portable computers' storage areas in mobile database environments. Their features include non-volatility, low power consumption, and fast access time for read operations, which are sufficient to present flash memories as major database storage components for portable computers. However, we need to improve traditional index management schemes based on B-Tree due to the relatively slow characteristics of flash operations, as compared to RAM memory. In order to … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
3
0

Year Published

2008
2008
2019
2019

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 11 publications
0
3
0
Order By: Relevance
“…In order to improve the performance of index operations in a flash memory database system, the work in [11] proposed an index management structure named F-Tree (Flash memory based Tree) based on the notion of compressed index rewriting to handle slow write/erase operations. This scheme resides between BFTL and FTL in order to compress and rewrite the packed index unit of BFTL.…”
Section: F-treementioning
confidence: 99%
See 2 more Smart Citations
“…In order to improve the performance of index operations in a flash memory database system, the work in [11] proposed an index management structure named F-Tree (Flash memory based Tree) based on the notion of compressed index rewriting to handle slow write/erase operations. This scheme resides between BFTL and FTL in order to compress and rewrite the packed index unit of BFTL.…”
Section: F-treementioning
confidence: 99%
“…Thus, B + -Tree is able to search more quickly with less I/O than B-Tree. F-Tree is based on B + -Tree and is able to handle the characteristics of flash memories efficiently [11]. Nevertheless, B-Tree, FTree and B + -Tree are not best suited for spatial and multimedia indexing applications.…”
Section: B + -Treementioning
confidence: 99%
See 1 more Smart Citation
“…Flash memory is commonly used as a secondary storage device for storing large capacity data in mobile terminals. However, it is relatively slow in processing write and delete operations compared to read operation, is unable to overwrite, and can only perform a limited number of deletes per page [2,5,6]. Accordingly, if a conventional spatial index is applied to flash memory as it is, then the number of write and delete operations of flash memory will be increased due to frequent node updates, which, in turn, increases operation time and lowers index performance.…”
Section: Introductionmentioning
confidence: 99%