Multi-Join Continuous Query Optimization: Covering the Spectrum of Linear, Acyclic, and Cyclic Queries

  • Authors:

  • Venkatesh Raghavan;Yali Zhu;Elke A. Rundensteiner;Daniel Dougherty

  • Affiliations:

  • Department of Computer Science, Worcester Polytechnic Institute, Worcester, USA 01609;Department of Computer Science, Worcester Polytechnic Institute, Worcester, USA 01609;Department of Computer Science, Worcester Polytechnic Institute, Worcester, USA 01609;Department of Computer Science, Worcester Polytechnic Institute, Worcester, USA 01609

  • Venue:
  • BNCOD 26 Proceedings of the 26th British National Conference on Databases: Dataspace: The Final Frontier
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Traditional optimization algorithms that guarantee optimal plans have exponential time complexity and are thus not viable in streaming contexts. Continuous query optimizers commonly adopt heuristic techniques such as Adaptive Greedy to attain polynomial-time execution. However, these techniques are known to produce optimal plans only for linear and star shaped join queries. Motivated by the prevalence of acyclic, cyclic and even complete query shapes in stream applications, we conduct an extensive experimental study of the behavior of the state-of-the-art algorithms. This study has revealed that heuristic-based techniques tend to generate sub-standard plans even for simple acyclic join queries. For general acyclic join queries we extend the classical IK approach to the streaming context to define an algorithm TreeOpt that is guaranteed to find an optimal plan in polynomial time. For the case of cyclic queries, for which finding optimal plans is known to be NP-complete, we present an algorithm FAB which improves other heuristic-based techniques by (i) increasing the likelihood of finding an optimal plan and (ii) improving the effectiveness of finding a near-optimal plan when an optimal plan cannot be found in polynomial time. To handle the entire spectrum of query shapes from acyclic to cyclic we propose a Q-Aware approach that selects the optimization algorithm used for generating the join order, based on the shape of the query.