PERFORMANCE IMPROVEMENTS OF MR-TREE OPERATIONS ON NAND FLASH MEMORY
Author(s):
Hyun Seung Lee,
Ha Yoon Song,
Kyung-chang Kim
Paper abstract: Flash memory can be a viable solution for the future embedded systems. Embedded systems usually
carry database as a part of embedded software. It is well known that Flash memory is far faster than
usual hard disk storages especially for read however it takes much time for Flash memory to delete than
to read or to write. For a database system, index trees on Flash memory have been widely studied for the
better performance. From our previous researches on indexing tree performance on Flash memory, we
suggest a delaying technique for index tree operations on Flash memory. Among B-tree, R-Tree and
MR-tree, we choose MR-tree as it is multimedia database index. Considering both of the flash memory
operation characteristics and MR-tree operation characteristics, we adjust MR-tree parameters for a just
fit for Flash memory and applied aggregated-delayed MR-tree operations on Flash memory. We believe
we find a reasonable parameter and efficient operation delaying technique for MR-tree on flash memory.
The benefit of our researches has been proven by the experimental results based on several database
access profiles.
Keywords:
Flash Memory, Index Tree, MR-Tree, Tree Block Size, Delayed Operation
Type:
Journal Paper
Full Contents (click to dowload):
First Page: 59
Last Page: 70
Year:
2008
Editors:
Anna Derezińska (Guest Editor)
ISBN:
ISSN: 1646-3692
Language:
English
Conference Name:
IADIS International Journal on Computer Science and Information System
