Abstract
The temporal aggregate in temporal databases is an extension of the conventional aggregate to include the time on the range condition of aggregation. It is a useful operation for Historical Data Warehouses, Call Data Records, and so on. In this paper, we propose a structure for the temporal aggregation with multiple range-condition attributes, called the ITA-tree, and an aggregate processing method based on the structure. In the ITA-tree, we transform the time interval of a record into a single value, called the T-value. Then, we index records according to their T-values like a B+-tree style. For possible hot-spot situations, we also propose an improvement of the ITA-tree, called the eITA- tree. Through analyses and experiments, we evaluate the performance of the proposed method.
Original language | English |
---|---|
Pages (from-to) | 243-265 |
Number of pages | 23 |
Journal | Information Sciences |
Volume | 168 |
Issue number | 1-4 |
DOIs | |
Publication status | Published - 2004 Dec 3 |
Keywords
- Databases
- Temporal aggregation
- Temporal databases
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Theoretical Computer Science
- Computer Science Applications
- Information Systems and Management
- Artificial Intelligence