Abstract
Recently, flash memory has been widely used as it has strong points, such as highspeed 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Software Engineering and Its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
