earticle

논문검색

Efficient Algorithm for Multi Query Optimization

초록

영어

Multi Query Optimization is an important process in database and it becomes the commonplace due to the frequent usage of decision support systems in almost all the multinational enterprises. The multiple queries from different users that have been addressed to one schema often have a lot of common sub-expressions and it is the function of the multi query optimization algorithms such as Basic Volcano, Volcano RU and Volcano SH algorithms to optimize such multiple queries together and executes the common operation once and share the output among the queries. In this work, a multi query shareability algorithm which can efficiently detect the common sub- expressions among the multiple queries and share the output among those queries was proposed and algorithm for optimal order of those queries was also proposed. The Algorithm has a time complexity of O(n2 + 9n +6) while the most recent basic algorithm thus Volcano RU Algorithm has O(2n2 +20n +12), both the algorithms have O(n2) time complexity which is quadratic in nature. However, the Proposed Algorithm is more efficient and better than Volcano RU algorithm even if n approach to infinity.

목차

Abstract
 1. Introduction
 2. Multi-Query Optimization (MQO)
 3. Multi-Query Optimization Algorithms
  3.1. Basic Volcano
  3.2. Volcano SH
  3.3. Volcano RU
 4. Multi Query Shareability Problem
 4. Efficient Multi Query Optimization Algorithm
  4.1. Multi Query Shareability Algorithm
  4.2. Efficient Optimal Order Algorithm
 5. Evaluation Analysis of the Algorithms
 6. Conclusion and Future Work
 References

저자정보

  • L. J. Muhammad Mathematics & Computer Science Department, Federal University, Kashere
  • Yahaya Bala Zakariyau Mathematics & Computer Science Department, Federal University, Kashere
  • Abdullahi Garba Ali Computer Science Department, Bayero University, Kano

참고문헌

    ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

    0개의 논문이 장바구니에 담겼습니다.