基于三级存储器的Join算法-软件学报.PDF

1000-9825/2003/14(05)0947 ©2003 Journal of Software 软 件 学 报 Vol.14, No.5 ∗ 基于三级存储器的 Join 算法 1,2 1+ 1 李建中 , 张冬冬 , 张艳秋 1(哈尔滨工业大学 计算机科学与技术学院,黑龙江 哈尔滨 150001) 2(黑龙江大学 计算机科学与技术学院,黑龙江 哈尔滨 150080) Join Algorithms Based on Tertiary Storage LI Jian-Zhong1,2, ZHANG Dong-Dong1+, ZHANG Yan-Qiu 1 1(College of Computer Science and Technology, Harbin Institute of Technology, Harbin 150001, China) 2(College of Computer Science and Technology, Heilongjiang University, Harbin 150080, China) + Corresponding author: Phn: 86-451-6415827, Fax: 86-451-6415827, E-mail: z_dd@ Received 2002-03-04; Accepted 2002-12-24 Li JZ, Zhang DD, Zhang YQ. Join algorithms based on tertiary storage. Journal of Soft ware, 2003,14(5): 947~954. /1000-9825/14/947.htm Abstract: The Join algorithms of massive relations in relational databases based on tertiary storage are studied in this paper. At present, Hash-Based Join algorithms are the best ones. However, the effect of tape locate time is not taken into consideration in these algorithms. It has great influence on the time complexity of the Join algorithms to locate positions on tertiary storages. For this reason, two new Join algorithms of massive relations in relational databases are proposed based on tertiary storage, Disk-Based-Hash-Join algorithm and Tertiary-Only-Hash-Join algorithm. Adopting disk buffer technique and the method of storing hashed data concentratedly, the cost of the random position locating on tertiary storage is much lower than other algorithms so that the proposed Join algorithms are more efficient. The analysis and experimental results show that the performance of this algorithms is superior to others, and thus they are