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: 106,041,570

 A Survey of the-State-of-the-Art B-tree Index on 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ố: 4;Từ->đến trang: 173-188;Năm: 2016
Lĩnh vực: Chưa xác định; Loại: Bài báo khoa học; Thể loại: Quốc tế
TÓM TẮT
Recently, flash memory has been widely used as it has strong points, such as high- speed access, low power consumption, high density and shock resistance. However, due to its hardware characteristics, specifically its erase-before-write feature, it is inefficient for deploying directly B+-tree index which produces a lot of write operations in random order when its nodes are updated. Thus, the normal B+-Tree structure is unfavorable for use in flash memory. Several variants of B+-tree have been proposed for flash memory so far. This paper surveys the state-of-the-art B+-tree index variants on flash memory that have been presented in conference proceedings and journals. It provides a broad overview of existing schemes, algorithms to solve them, and discusses related research issues.
ABSTRACT
Recently, flash memory has been widely used as it has strong points, such as high- speed access, low power consumption, high density and shock resistance. However, due to its hardware characteristics, specifically its erase-before-write feature, it is inefficient for deploying directly B+-tree index which produces a lot of write operations in random order when its nodes are updated. Thus, the normal B+-Tree structure is unfavorable for use in flash memory. Several variants of B+-tree have been proposed for flash memory so far. This paper surveys the state-of-the-art B+-tree index variants on flash memory that have been presented in conference proceedings and journals. It provides a broad overview of existing schemes, algorithms to solve them, and discusses related research issues.
[ 2020\2020m06d025_10_58_13A_Survey_of_the-State-of-the-Art_B-tree_Index_on_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