Performance analysis of B+-Tree and CSB+-Tree in main memory database

The bottleneck is not the disk I/O but CUP clock speed faster than the memory speed in main memory database. In order to achieve high performance in main memory database, it is a good approach to design new index structures to improve the memory access speed. This paper establishes a cost model for B+-Tree and CSB+-Tree and analyze several parameters that influence the access performance such as key size, pointer size, node size, number of records, number of duplicate values, data orderliness and so on.