A Graph-Based Sliding Window Multi-Join over Data Stream
Join operation is a critical problem when dealing with sliding window over data streams. There have been many optimization strategies for sliding window join in the literature, but a simple heuristic is always used for selecting the join sequence of many sliding windows, which is ineffectively. In this paper we propose the graph-based approach to process the problem. The sliding window join model is introduced primarily. In this model vertex represent join operator and edge indicate the join relationship among sliding windows. Vertex weight and edge weight represent the cost of join and the reciprocity of join operators respectively. Then good query plan with minimal cost can be found in the model. Thus a complete join algorithm combining setting up model, finding optimal query plan and executing query plan is shown.Experiments show that the graph-based approach is feasible and can work better in above environment.
Liang Zhang Byeong-Seob You Jun-Wei Ge Zhao-Hong Liu Hae-Young Bae
College of Computer Science and Technology, Chongqing Univ. of Posts & Telecom.,400-065, China Department of Computer Science and Information Engineering, Inha University 253 Yonghyun-dong, Nam-g
国际会议
重庆
英文
398-405
2007-04-24（万方平台首次上网日期，不代表论文的发表时间）