摘要
随着内存价格的不断走低,数据库中的数据在内存中运行已经具有了一定的可行性。内存数据库有着比磁盘数据库无法比拟的优势,那就是在实时和高并发的应用上所展现的能力。因此基于磁盘的索引算法已经不能适应内存数据库的要求,有必要探索出一种新的索引算法。文中从当今研究比较热门的敏感索引树出发,分析了CSB+索引树的优缺点及适用情形,设计出了一种改进CSB+树的查询算法,得出改进后的CSB+树对TLB失配具有显著的改善效果,提高了内存数据库的性能。
With the low price of memory,the data in the database is fully feasible,and the ability of memory database in real-time and high concurrency is not suitable for disk database. Therefore,a new algorithm is proposed. This paper analyzes the advantages and disadvantages of CSB + index tree and its application,and designs a new algorithm to improve the CSB + tree,and gives out the comparison of CSB + tree and TLB tree. The improved CSB + tree has a significant effect on TLB mismatch,and improves the performance of the memory database.
出处
《信息技术》
2016年第11期139-142,共4页
Information Technology
