摘要
针对目前内存数据库中索引缓存失配的问题,提出一种基于缓存优化的MCTH树索引结构。它不仅考虑到缓存失配对系统性能的影响,同时也考虑到TLB失配的因素,对MCTH树索引结构的分析和实验测试表明:MCTH树索引结构与相关索引结构相比具有更好的有效性和优越性。
Aiming at the cache mismatch problem of index in main memory database,a MCTH-tree index structure is proposes based on cache optimization.It gives attention to the effects of cache misses and TLB misses.According to index structure analysis,it is concluded that MCTH-tree supports cache optimization.Detailed description on data structure and operation algorithm are given.A series of experiments show that MCTH-tree is verified to have better effectiveness and superiority compared with the relevant index structure.
出处
《桂林理工大学学报》
CAS
北大核心
2012年第4期547-552,共6页
Journal of Guilin University of Technology
基金
国家自然科学基金面上项目(60973046)
中国博士后科学基金(20100471353)
