An Indexed Non-Equijoin Algorithm Based on Sliding Windows over Data Streams

作     者：YU Ya-xin YANG Xing-hua YU Ge WU Shan-shan YU Ya-xin, YANG Xing-hua, YU Ge, WU Shan-shan School of Computer Science and Engineering, Northeastern University, Shenyang 110004, Liaoning, China

作者机构：School of Computer Science and EngineeringNortheastern University Shenyang 110004 Liaoning China 

出 版 物：《Wuhan University Journal of Natural Sciences》 (武汉大学学报（自然科学英文版）)

年 卷 期：2006年第11卷第1期

页      面：294-298页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 

基　　金：Supported by the National Natural Science Foun-dation of China (60473073) 

主　　题：non-equijoin data stream sliding window red-black indexing tree 

摘      要：Processing a join over unbounded input streams requires unbounded memory, since every tuple in one infinite stream must be compared with every tuple in the other. In fact, most join queries over unbounded input streams are restricted to finite memory due to sliding window constraints. So far, non-indexed and indexed stream equijoin algorithms based on sliding windows have been proposed in many literatures. However, none of them takes non-equijoin into consideration. In many eases, non-equijoin queries occur frequently. Hence, it is worth to discuss how to process non-equijoin queries effectively and efficiently. In this paper, we propose an indexed join algorithm for supporting non-equijoin queries. The experimental results show that our indexed non-equijoin techniques are more efficient than those without index.