Thông tin chung
  English
  Đề tài NC khoa học
  Bài báo, báo cáo khoa học
  Hướng dẫn Sau đại học
  Sách và giáo trình
  Các học phần và môn giảng dạy
  Giải thưởng khoa học, Phát minh, sáng chế
  Khen thưởng
  Thông tin khác
  Tài liệu tham khảo
  Hiệu chỉnh
 
Số người truy cập: 107,080,554

 An Efficient B-tree Index Scheme for Flash Memory (ISI/SCOPUS)
Tác giả hoặc Nhóm tác giả: VanPhi Ho, Dongjoo Park
Nơi đăng: International Journal of Software Engineering and Its Applications; Số: 2;Từ->đến trang: 51-64;Năm: 2017
Lĩnh vực: Công nghệ thông tin; Loại: Bài báo khoa học; Thể loại: Quốc tế
TÓM TẮT
B-tree index structure is widely used for many database management systems and file systems which are popularly implemented on flash-based storage device nowadays. Flash memory has been popularly used because of its prominent advantages such as fast access speed, nonvolatile, high reliability, low power consumption. Due to hardware restriction such as erase-before-write, however, the performance of flash memory significantly degrades when directly implementing B-tree on flash memory. This study introduces an efficient B-tree index scheme that improves the performance of B-tree index on flash memory called EBIF. EBIF can reduce the number of flash operations and minimize the number of pages used to store the B-tree by applying overflow mechanism and eliminating redundant index units in the index buffer. The experimental results show that EBIF yields a better performance than those of the other existing variants of B-tree index.
ABSTRACT
B-tree index structure is widely used for many database management systems and file systems which are popularly implemented on flash-based storage device nowadays. Flash memory has been popularly used because of its prominent advantages such as fast access speed, nonvolatile, high reliability, low power consumption. Due to hardware restriction such as erase-before-write, however, the performance of flash memory significantly degrades when directly implementing B-tree on flash memory. This study introduces an efficient B-tree index scheme that improves the performance of B-tree index on flash memory called EBIF. EBIF can reduce the number of flash operations and minimize the number of pages used to store the B-tree by applying overflow mechanism and eliminating redundant index units in the index buffer. The experimental results show that EBIF yields a better performance than those of the other existing variants of B-tree index.
[ 2020\2020m06d025_11_0_28[6]_An_Efficient_B-tree_Index_Scheme__for_Flash_Memory.pdf ]
© Đại học Đà Nẵng
 
 
Địa chỉ: 41 Lê Duẩn Thành phố Đà Nẵng
Điện thoại: (84) 0236 3822 041 ; Email: dhdn@ac.udn.vn