[1]钱江波,徐宏炳,董逸生,等.共享连接结果的连续查询处理[J].东南大学学报(自然科学版),2007,37(1):5-8.[doi:10.3969/j.issn.1001-0505.2007.01.002]
　Qian Jiangbo,Xu Hongbing,Dong Yisheng,et al.Continuous queries processing by sharing intermediate join results[J].Journal of Southeast University (Natural Science Edition),2007,37(1):5-8.[doi:10.3969/j.issn.1001-0505.2007.01.002]
点击复制

共享连接结果的连续查询处理()
分享到：

《东南大学学报(自然科学版)》[ISSN:1001-0505/CN:32-1178/N]

卷:
37
期数:
2007年第1期
页码:
5-8
栏目:
计算机科学与工程
出版日期:
2007-01-20

文章信息/Info

Title:
Continuous queries processing by sharing intermediate join results
作者:
钱江波1; 2;  徐宏炳1;  董逸生1;  刘学军1;  王永利1;  杨雪梅1
1 东南大学计算机科学与工程学院, 南京 210096; 2 宁波大学信息科学与工程学院, 宁波 315211
Author(s):
Qian Jiangbo1; 2;  Xu Hongbing1;  Dong Yisheng1;  Liu Xuejun1;  Wang Yongli1;  Yang Xuemei1
2 School of Computer Science and Engineering, Southeast University, Nanjing 210096, China
1 School of Information Science and Engineering, Ningbo University, Ningbo 315211, China
关键词:
数据流;  连续查询;  窗口连接;  选择操作
Keywords:
data stream;  continuous queries;  window join;  selection operation
分类号:
TP311.13
DOI:
10.3969/j.issn.1001-0505.2007.01.002
摘要:
深入研究了适合数据流连续查询处理的Shared PushDown,PullUp和Filtered PullUp三种可共享连接结果的策略.通过理论分析和实验证明,在数据流的连续查询处理中,PullUp策略性能较低,而Filtered PullUp和Shared PushDown策略各占优势.Filtered PullUp处理简单,消耗内存相对较少.而Shared PushDown增加内存使用,但在注册查询的选择因子覆盖较少时有一定优势.考虑到处理的方便,一般情况下Filtered PullUp是适合数据流连续查询处理的最佳方案.
Abstract:
The traditional heuristic algorithm of pushing selection predicates below joins is possibly less efficient for continuous queries, because early selection destroys the ability to share subsequent high cost join processing. Three alternative selection placement strategies, which can share join results, are evaluated. Theoretics and experimental results show that PullUp strategy(selections are pulled above joins)has poor efficiency, and Filtered PullUp strategy(data stream tuples are filtered by the union of the selection predicates, then to be executed by PullUp strategy)is better than Shared PushDown strategy(selections are pushed below joins)because the former is simple and uses less memory.

参考文献/References:

[1] Babcock B,Babu S,Datar M,et al.Models and issues in data stream systems [C] //PODS.New York:ACM Press,2002:1-16.
[2] Golab L,Ozsu M T.Issues in data stream management [J]. SIGMOD Record,2003,32(2):5-14.
[3] Chen J,de Witt D J,Naughton J F.Design and evaluation of alternative selection placement strategies in optimizing continuous queries [C] //ICDE02.Washington:IEEE Computer Society,2002:345-356.
[4] Arasu A,Babu S,Widom J.An abstract semantics and concrete language for continuous queries over streams and relations [EB/OL].(2002)[2006-02].http://dbpubs.stanford.edu:8090/pub/.
[5] Babcock B,Datar M,Motwani R.Sampling from a moving window over streaming data [C] //ACM-SIAM SODA.New York:ACM Press,2002:633-634.
[6] Ayad A,Naughton J F.Static optimization of conjunctive queries with sliding windows over infinite streams [C] //ACM SIGMOD.New York:ACM Press,2004:419-430.
[7] Motwani R,Widom J,Arasu A,et al.Query processing,approximation,and resource management in a data stream management system [C] //The 1st Biennial CIDR.Asilomar,CA,USA,2003:245-256.
[8] Qian Jiangbo,Xu Hongbing,Dong Yisheng,et al.FPGA acceleration window joins over multiple data stream [J].Journal of Circuits,Systems,and Computers,2005,14(4):813-830.
[9] 钱江波,徐宏炳,王永利,等.多数据流滑动窗口并发连接方法[J].计算机研究与发展,2005,42(10):1771-1778.
　 Qian Jiangbo,Xu Hongbing,Wang Yongli,et al.Simultaneous sliding window join approach over multiple data streams [J]. Journal of Computer Research and Development,2005,42(10):1771-1778.(in Chinese)

备注/Memo

备注/Memo:
基金项目: 江苏省高技术研究资助项目(BG2004034)、江苏省2004年度研究生创新计划资助项目(xm04-36).
作者简介: 钱江波(1974—),男, 博士生, qianjb@nbip.net; 董逸生(联系人), 男, 教授,博士生导师, ysdong@seu.edu.cn.
更新日期/Last Update: 2007-01-20