期刊名称:International Journal of Advanced Research in Computer Engineering & Technology (IJARCET)
印刷版ISSN:2278-1323
出版年度:2013
卷号:2
期号:3
页码:1187-1191
出版社:Shri Pannalal Research Institute of Technolgy
摘要:As the data management field has diversified to consider settings in which queries are increasingly complex, statistics are less available, or data is stored remotely, there has been an acknowledgment that the traditional optimize-then-execute paradigm is insufficient. The main objective of our project is to develop and produce an optimized global execution plan for the collective evaluation of a static set of multi-way continuous queries. Generally in a data stream environment, a considerable number of continuous queries are registrated in advance and should be processed continuously. For that there is a need of multiple query optimizations. For this purpose, this paper proposes a new method called A-SEGO that optimizes a set of multi-way join queries collectively by tracing a set of promising subplans. The proposed approach uses a cost profile that maintains statistical synopses of the cost of join operations in past global execution plans. Based on these cost statistics and on a user-defined cost-bound parameter, a set of promising subplans is determined to trace them concurrently. This paper focuses on producing an optimized global execution plan for the collective evaluation of a static set of multi-way continuous queries. In real data stream applications, a set of continuous queries registered in a DSMS can be changed as time goes. Therefore, it is necessary to devise an incremental optimization mechanism. With this approach, the system needs to store existing query computations, identify the common computations between the new query and the existing query plan, choose optimally among multiple sharing paths, and add unsharable new computations to the plan[4].