基于共享Cache多核处理器的Radix聚集连接优化

Radix Cluster Join Optimization Based on Shared Cache Chip Multi-processor

基于目前主流的多核处理器,研究了数据库Radix-Join算法中的聚集连接优化。针对多线程聚集连接执行时,线程Cache访问缺失严重的问题,采用预读线程预先将聚集连接线程需要访问的聚集对从内存读入L2-Cache,提高了线程的Cache访问性能。并根据聚集连接执行时的代价模型,优化了聚集连接执行框架和各种线程参数。在实验中,基于内存数据库EaseDB实现了本文提出了算法,实验结果表明,聚集连接性能得到较大提高。

Based on Chip Muhi-Processor（CMP）, tiffs paper presents optimization of cluster join in Radix-Join algorithm. In order to solve the problem of serious cache may miss during the multithreaded duster join execution, and to improve the performance of cache access, we adopt preload thread to read the clusters whose thread will access from memory to L2-Cache. Furthermore, based on the cost model of cluster join execution, the framework of cluster join execution and various thread parameters have been optimized. In the experiments, we implement the algorithm in EaseDB. The results show that cluster join performance is improved.