ACM Home Page
Please provide us with feedback. Feedback
On computing temporal aggregates with range predicates
Full text PdfPdf (1.15 MB)
Source
ACM Transactions on Database Systems (TODS) archive
Volume 33 ,  Issue 2  (June 2008) table of contents
Article No. 12  
Year of Publication: 2008
ISSN:0362-5915
Authors
Donghui Zhang  Northeastern University, Boston, MA
Alexander Markowetz  Hong Kong University of Science and Technology, Kowloon, Hong Kong
Vassilis J. Tsotras  University of California, Riverside, CA
Dimitrios Gunopulos  University of California, Riverside, CA
Bernhard Seeger  Philipps Universität Marburg, Germany
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 20,   Downloads (12 Months): 128,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1366102.1366109
What is a DOI?

ABSTRACT

Computing temporal aggregates 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 aggregate queries are critical. Previous approaches have aggregate predicates that involve only the time dimension. In this article we examine techniques to compute temporal aggregates that include key-range predicates as well (range-temporal aggregates). In particular we concentrate on the SUM aggregate, while COUNT is a special case. 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 aggregate queries. We analyze the performance of our approach and present experimental results that show its efficiency. Furthermore, we address a novel and practical variation called functional range-temporal aggregates. Here, the value of any record is a function over time. The meaning of aggregates is altered such that the contribution of a record to the aggregate result is proportional to the size of the intersection between the record's time interval and the query time interval. Both analytical and experimental results show the efficiency of our result.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
 
5
 
6
 
7
 
8
 
9
 
10
Kline, N. and Soo, M. 1998. Time-IT, the time-integrated testbed. ftp://ftp.cs.arizona.edu/timecenter/time-it-0.1.tar.gz.
 
11
 
12
13
 
14
 
15
 
16
 
17
 
18
Yang, J. and Widom, J. 2003. Incremental computation and maintenance of temporal aggregates. In Proceedings of the International Conference on Very Large Data Bases (VLDB) 12, 3, 262--283.
 
19
Ye, X. and Keane, J. 1997. Processing temporal aggregates in parallel. In Proceedings of the International Conference on Systems, Man, and Cybernetics. 1373--1378.
20
21


Collaborative Colleagues:
Donghui Zhang: colleagues
Alexander Markowetz: colleagues
Vassilis J. Tsotras: colleagues
Dimitrios Gunopulos: colleagues
Bernhard Seeger: colleagues