Database indexes have a significant impact to speed up access to particular item or items. While B+Tree is the most important index structure for disk-based database management systems (DBMS), T*-Tree is optimized for main memory access and widely used for in memory database system (IMDB). however, the prior researches made performance evaluation between T*-Tree and B+Tree on hardware with different memory hierarchy characteristics and single core CPU due to some of these studies published nearly two decades ago. In this paper, we implemented the state of the art of T*-Tree and B+Tree for main memory use. The two indexes structure were tested on modern hardware. Unlike the previous experimental results, our test performed shows that B+Tree is faster than T*-Tree in the most of the test cases.