Abstract
There are some shortcomings for the cache sensitivity of the index in main memory database, so a new index structure is proposed. T -tree index is studied individually ever before, so as Hash index. Combined with the analysis of the two index structure, a new index structure called the T-Hash tree is introduced. Through analyzing the times of the T -Hash tree cache sensitive and testing the performance of the query, insert, delete operation, the results show that the T -Hash tree can effectively reduce the times of cache sensitive, and as the amount of the data is large, the query, insert, delete efficiency of the T -Hash tree is higher than the T tree.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
