A study on a fast database processing method toward the era of multicore processors

本文以磁盘缓冲区管理和顺序模式挖掘为研究对象，研究了它们的算法和实现方法，以充分利用多核处理器的潜力。因此，对于前一种情况，我们显示访问缓冲区的吞吐量与内核数量的增加几乎是线性的。对于后一种情况，由于减少了缓存缺失次数，本文提出的缓存敏感顺序模式挖掘算法的速度比现有算法快2倍，在可扩展性中使用6个线程时，速度提高了4倍以上。

In this study, we focused on the topics of disk buffer management and sequential pattern mining, and studied on their algorithms and implementation methods so that we can make use of the potential of multicore processors. As a result, as for the former case, we showed almost linear throughput of accessing the buffer to an increase in the number of cores. As for the latter case, the proposed cache-conscious sequential pattern mining algorithm obtained 2x faster than the existing one because of the reduction of the number of cache misses, and more than 4x speedups when six threads are used in its scalability.