关键词: B+树, 性能测试, 索引, 数据库

Abstract: The increment of flash memory devices provides opportunity for large flashbased applications, and hence flash based database has become one of the promising research areas. B+-tree is the most widely adopted index, which is a fundamental structure for DBMS. The performance of B+-tree stored on both flash chip simulator and SSD is both evaluated. The authors evaluated the basic IO features of SSD and compared it with the traditional hard disk, followed by the detailed testing result on the B+-tree. The results show that node size, buffer and data distribution have great effect on the performance of B+-tree. Due to the asymmetry of flash input and output speed, the optimal node size of query and insertion are different from each other. These testing results will be a meaningful guidance for both application and improvement of B+-tree.

Key words: B+ tree, performance testing, indexing, database