Queries on dates: fast yet not blind

  • Authors:
  • Jaroslaw Szlichta;Parke Godfrey;Jarek Gryz;Wenbin Ma;Przemyslaw Pawluk;Calisto Zuzarte

  • Affiliations:
  • York University, Toronto, Canada;York University, Toronto, Canada;York University, Toronto, Canada;IBM Laboratory, Toronto, Canada;York University, Toronto, Canada;IBM Laboratory, Toronto, Canada

  • Venue:
  • Proceedings of the 14th International Conference on Extending Database Technology
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data warehouses are repositories of electronically stored data which are designed to support reporting and analysis. The analysis of historical data often involves aggregation over time. Thus, time is critical in the design of a data warehouse. We describe novel techniques for storing date information and optimization of queries that reference the date dimension. We show how to embed intelligence into the date key and how to exploit monotonic dependencies. We present the value of these techniques for the improvement of performance when combined with partitioning and indexes. We evaluate these techniques on our prototype implemented in IBM® DB2® V9.7 over the current draft version of the TPC-DS benchmark.