Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2011.18D.3.157

AS B-tree: A study on the enhancement of the insertion performance of B-tree on SSD  

Kim, Sung-Ho (연세대학교 컴퓨터과학과)
Roh, Hong-Chan (연세대학교 컴퓨터과학과)
Lee, Dae-Wook (서강대학교 컴퓨터공학과)
Park, Sang-Hyun (연세대학교 컴퓨터과학과)
Publication Information
The KIPS Transactions:PartD / v.18D, no.3, 2011 , pp. 157-168 More about this Journal
Abstract
Recently flash memory has been being utilized as a main storage device in mobile devices, and flashSSDs are getting popularity as a major storage device in laptop and desktop computers, and even in enterprise-level server machines. Unlike HDDs, on flash memory, the overwrite operation is not able to be performed unless it is preceded by the erase operation to the same block. To address this, FTL(Flash memory Translation Layer) is employed on flash memory. Even though the modified data block is overwritten to the same logical address, FTL writes the updated data block to the different physical address from the previous one, mapping the logical address to the new physical address. This enables flash memory to avoid the high block-erase cost. A flashSSD has an array of NAND flash memory packages so it can access one or more flash memory packages in parallel at once. To take advantage of the internal parallelism of flashSSDs, it is beneficial for DBMSs to request I/O operations on sequential logical addresses. However, the B-tree structure, which is a representative index scheme of current relational DBMSs, produces excessive I/O operations in random order when its node structures are updated. Therefore, the original b-tree is not favorable to SSD. In this paper, we propose AS(Always Sequential) B-tree that writes the updated node contiguously to the previously written node in the logical address for every update operation. In the experiments, AS B-tree enhanced 21% of B-tree's insertion performance.
Keywords
Lash Memory; B-Tree; FTL; SSD; Parallelism;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Chen, Feng, Doctor of Philosophy, Ohio State University, Computer Science and Engineering, 2010, "ON PERFORMANCE OPTIMIZATION AND SYSTEM DESIGN OF FLASH MEMORY BASED SOLID STATE DRIVES IN THE STORAGE HIERARCHY", 2010.
2 CHIN-HSIEN WU, TEI-WEI KUO and Li Ping Chang, National Taiwan University, "An efficient B-tree layer implementation for flash-memory storage systems, ACM Transactions on Embedded Computing Systems (TECS), 2007. 7.
3 Dongwon Kang, Dawoon Jung, Jeong-Uk Kang, Jin-Soo Kim, Computer Science Division Korea Advanced Institute of Science and Technology (KAIST), " ${\mu}$-tree: an ordered index structure for NAND flash memory", International Conference On Embedded Software, Proceedings of the 7th ACM & IEEE international conference on Embedded software, 2007.   DOI
4 Nitin Agrawal, Vijayan Prabhakaran, Ted Wobber, John D. Davis, Mark Manasse, Rina Panigrahy Microsoft Research, Silicon Valley, University of Wisconsin-Madison, "Design tradeoffs for SSD performance", USENIX 2008 Annual Technical Conference on Annual Technical Conference, 2008.
5 남정현(Jung-hyun Nam), 박동주(Dong-joo Park), "플래시 메모리 상에서 B-트리 설계 및 구현", 정보과학회논문지 : 데이타 베이스 제34권 제2호, 2007. 4.   과학기술학회마을
6 Feng Chen, David A. Koufaty, and Xiaodong Zhang, "Understanding Intrinsic Characteristics and System Implications of Flash Memory based Solid State Drives", Joint International Conference on Measurement and Modeling of Computer Systems, Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems, 2009.