A novel main memory database T-tree index optimization algorithm

Now main memory database obtains more and more widespread application in critical application, along with the continuous increasing of the data throughput capacity, the store-in data are getting more and more, the complexity is getting higher and higher, how to enhance the overall performance of the main memory database, this paper proposed a novel T tree index optimization algorithm, has designed new data structures and algorithms to increase the efficiency of the main memory database(MMDB), has optimized T tree index of the memory database, reduces the balanced revolving times in the T tree, raises the T tree's index efficiency. Results indicate that T-tail Tree provides very good performance in MMDB.