Optimization of Query Plan in Data Stream System
Based on the research on the data stream basic model proposed by the Stanford University, we focus on the problems about the cost model of query plan and the optimization of query plan, and do further research on those problems. According to analysis the data characteristics, the data arrival rate, the selectivity of the query operations and the correlation among the query operations in data stream, we propose a core algorithm called CSOQP (combination section optimization query plan), which can strongly optimize the query plan. With a proper parameter, our algorithm can easily cope with the fluctuating problem in selection of query plan. We propose that the goal should be to find an execution plan that minimizes the memory requirement in the worst situation.
CSOQP data stream query plan EDDY selectivity
ZHENG Zhanping LIN Jinxian
College of Mathematics and Computer Science University of fuzhou Fuzhou, Fujian Province, China
国际会议
厦门
英文
341-344
2006-07-27（万方平台首次上网日期，不代表论文的发表时间）