Efficient computation of temporal aggregates with range predicates

  • Authors:

  • Donhui Zhang;Alexander Markowetz;Vassilis Tsotras;Dimitrios Gunopulos;Bernhard Seeger

  • Affiliations:

  • Computer Science Department, University of California, Riverside, CA;Fachbrreich Mathematik & Informatik, Philipps Universitát Marburg, Germany;Computer Science Department, University of California, Riverside, CA;Computer Science Department, University of California, Riverside, CA;Fachbrreich Mathematik & Informatik, Philipps Universitát Marburg, Germany

  • Venue:
  • PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

A temporal aggregation query is an important but costly operation for applications that maintain time-evolving data (data warehouses, temporal databases, etc.). Due to the large volume of such data, performance improvements for temporal aggregation queries are critical. In this paper we examine techniques to compute temporal aggregates that include key-range predicates (range temporal aggregates). In particular we concentrate on SUM, COUNT and AVG aggregates. This problem is novel; to handle arbitrary key ranges, previous methods would need to keep a separate index for every possible key range. We propose an approach based on a new index structure called the Multiversion SB-Tree, which incorporates features from both the SB-Tree and the Multiversion B-Tree, to handle arbitrary key-range temporal SUM, COUNT and AVG queries. We analyze the performance of our approach and present experimental results that show its efficiency.