计算机应用研究2024，Vol.41Issue(10)：3093-3099,7.DOI:10.19734/j.issn.1001-3695.2024.02.0051
基于路径预取的树型索引查询优化
Tree-based in-memory index query optimization based on path prefetching
来逸瑞 1李永坤 1许胤龙1
作者信息
- 1. 中国科学技术大学计算机科学与技术学院,合肥 230027
- 折叠
摘要
Abstract
In the process of researching tree-based in-memory indexes,traditional on-chip prefetching cannot adapt to the lo-cality of index accesses,resulting in memory accesses becoming a performance bottleneck of this type of memory index.This paper proposed a path prefetching scheme at the software level to accelerate memory index accesses by prefetching,and ena-bled the algorithm to be quickly deployed on real machines.Based on the analysis of the tree-based indexes memory access process,this algorithm used a prefetch table to save the relationship between keys and index access paths,and matched data in the prefetch table through a matching algorithm based on key slice hashing.This paper implemented and evaluated the algo-rithm on current advanced tree-based memory indexes.The results indicate that it maintains stable performance improvement under different data scale and read-write-mixed workloads.Therefore,the algorithm based on path prefetching can effectively accelerate the memory access speed of tree-based in-memory index and improve index performance.关键词
内存索引/预取/缓存/内存层次结构Key words
memory index/prefetch/cache/memory hierarchy分类
信息技术与安全科学引用本文复制引用
来逸瑞,李永坤,许胤龙..基于路径预取的树型索引查询优化[J].计算机应用研究,2024,41(10):3093-3099,7.
