Efficient Execution of Multiple Queries on Deep Memory Hierarchy  

作　　者：张岩 陈智峰 周源源 

机构地区：[1]National Laboratory on Machine Perception, Peking University, Beijing 100871, China [2]Google Inc., 1600 Amphitheatre Parkway, Mountain View, CA 94043, U.S.A. [3]Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801, U.S.A.

出　　处：《Journal of Computer Science & Technology》2007年第2期273-279,共7页计算机科学技术学报（英文版）

摘　　要：This paper proposes a complementary novel idea, called MiniTasking to further reduce the number of cache misses by improving the data temporal locality for multiple concurrent queries. Our idea is based on the observation that, in many workloads such as decision support systems （DSS）, there is usually significant amount of data sharing among different concurrent queries. MiniTasking exploits such data sharing to improve data temporal locality by scheduling query execution at three levels： query level batching, operator level grouping and mini-task level scheduling. The experimental results with various types of concurrent TPC-H query workloads show that, with the traditional N-ary Storage Model （NSM） layout, MiniTasking significantly reduces the L2 cache misses by up to 83%, and thereby achieves 24% reduction in execution time. With the Partition Attributes Across （PAX） layout, MiniTasking further reduces the cache misses by 65% and the execution time by 9%. For the TPC-H throughput test workload, MiniTasking improves the end performance up to 20%.This paper proposes a complementary novel idea, called MiniTasking to further reduce the number of cache misses by improving the data temporal locality for multiple concurrent queries. Our idea is based on the observation that, in many workloads such as decision support systems （DSS）, there is usually significant amount of data sharing among different concurrent queries. MiniTasking exploits such data sharing to improve data temporal locality by scheduling query execution at three levels： query level batching, operator level grouping and mini-task level scheduling. The experimental results with various types of concurrent TPC-H query workloads show that, with the traditional N-ary Storage Model （NSM） layout, MiniTasking significantly reduces the L2 cache misses by up to 83%, and thereby achieves 24% reduction in execution time. With the Partition Attributes Across （PAX） layout, MiniTasking further reduces the cache misses by 65% and the execution time by 9%. For the TPC-H throughput test workload, MiniTasking improves the end performance up to 20%.

关 键 词：cache performance temporal locality mini-task scheduling concurrent queries 

分 类 号：TP333[自动化与计算机技术—计算机系统结构]