Memory Database Index Optimization

Index is used to improve the efficiency of database queries. Because the database needs to handle very large amount of data, while the memory is expensive, limited capacity, and the database must meet certain real-time, finding an effective design approach of the index is very necessary. This paper describes that through the B and T tree performance analysis during the process of designing the index, put forward the new thinking of improving the index, after doing the experiment, as allow the database to either use the B tree or use the T tree, in time and space, how to select both timely in order to enhance the query, insert, and delete efficiency of the database index.