Achieving high freshness and optimal throughput in CPU-limited execution of multi-join continuous queries

  • Authors:

  • Abhishek Mukherji;Elke A. Rundensteiner;Matthew O. Ward

  • Affiliations:

  • Computer Science Department, Worcester Polytechnic Institute, Worcester MA;Computer Science Department, Worcester Polytechnic Institute, Worcester MA;Computer Science Department, Worcester Polytechnic Institute, Worcester MA

  • Venue:
  • BNCOD'11 Proceedings of the 28th British national conference on Advances in databases
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Due to high data volumes and unpredictable arrival rates, continuous query systems processing expensive queries in real-time may fail to keep up with the input data streams - resulting in buffer overflow and uncontrolled data loss. We explore join direction adaptation (JDA) to tackle CPU-limited processing of multi-join stream queries. The existing JDA solutions allocate the scarce CPU resources to the most productive half-way join within a single operator. We instead leverage the operator interdependencies to optimize the overall query throughput. We identify result staleness, typically ignored by most state-of-the-art techniques, as a critical issue in CPU-limited processing. It gets further aggravated if throughput optimizing techniques are employed. We establish the novel pathproductivity model and the Freshness predicate. Our proposed JAQPOT approach is the first integrated solution to achieve near optimal query throughput while also guaranteeing freshness satisfiability. JAQPOT runs in quadratic time of the number of streams irrespective of the query plan shape. Our experimental study demonstrates the superiority of JAQPOT in achieving higher throughput than the state-of-the-art JDA strategy while also fulfilling freshness predicates.