Exploiting Internal Parallelism of SSD for Hash Join

作     者：YANG Lianghuai ZHANG Ting FAN Yulei GONG Weihua YU Jian YANG Lianghuai;ZHANG Ting;FAN Yulei;GONG Weihua;YU Jian

作者机构：School of Computer Science and Technology Zhejiang University of Technology School of Computing and Mathematical Sciences Auckland University of Technology 

出 版 物：《Chinese Journal of Electronics》 (电子学报(英文))

年 卷 期：2019年第28卷第5期

页      面：889-898页

核心收录：

学科分类：08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by the Zhejiang Provincial Natural Science Foundation(No.LY14F020017,No.LQ15F020007) the National Natural Science Foundation of China(No.61070042) 

主　　题：Hash join Internal parallelism I/O granularity Queue depth Solid state drive 

摘      要：By regarding a Solid-state drive(SSD) as a black box and observing its external behavior instead of peeping into its internal details, we investigate how the factors of I/O granularity and I/O queue depth influence the throughput of an SSD through a series of experiments and relate to the internal parallelism of an SSD, and then propose the concept of Combination equivalence class(CEC) as the set of combination pairs of these two factors.A novel buffer allocation scheme for hash join over SSDs is invented by taking both factors into account. Extensive experiments demonstrate the effectiveness of our scheme.