An efficient method for temporal aggregation with range-condition attributes

  • Authors:
  • Sung Tak Kang;Yon Dohn Chung;Myoung Ho Kim

  • Affiliations:
  • GSM Laboratory, LG Electronics, Emerald Bld. 1042, Bumgye-Dong, Dongan-Gu, Ahn-Yang 431-085, South Korea;Department of Computer Engineering, Dongguk University 26, 3 ga, Pil-Dong, Chung-Gu, Seoul 100-715, South Korea;Division of Computer Science, Korea Advanced Institute of Science and Technology, 373-1, Kusung-Dong, Yusung-Gu, Taejon 305-701, South Korea

  • Venue:
  • Information Sciences—Informatics and Computer Science: An International Journal
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

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.