Database Systems - Reducing Error-Prone Selectivity Space for the Plan Bouquet algorithm
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Failed to load latest commit information.

IKEBANA - ESS Dimensions Reduction For Plan Bouquet


Database Systems - IISc Course Project

  • We aim to enhance the performance of the Plan Bouquet algorithm for query processing, proposed in the paper presented at VLDB 2014. The paper defines plan bouquet approach as:

In this paper, we investigate a conceptually new approach, wherein the compile-time estimation process is completely eschewed for error-prone selectivities. Instead, these selectivities are systematically discovered at run-time through a calibrated sequence of cost- limited executions of a set of bouquet plans.

Algorithm IKEBANA

  • Firstly, the above code attempts to find the ESS dimension, which on elimination would result in least performance impact on query execution by bouquet approach
  • Secondly, it identifies the "best" bouquet of plans along with the budgets to be executed in the reduced ESS space
  • Further Details of this project are here in my blog:



Free Software, Hell Yeah!