An efficient method for temporal aggregation with range-condition attributes

Sung Tak Kang, Yon Dohn Chung, Myoung Ho Kim

Research output: Contribution to journalArticle

3 Citations (Scopus)

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 languageEnglish
Pages (from-to)243-265
Number of pages23
JournalInformation Sciences
Volume168
Issue number1-4
DOIs
Publication statusPublished - 2004 Dec 3
Externally publishedYes

Fingerprint

Temporal Aggregation
Agglomeration
Attribute
Range of data
Data warehouses
Temporal Databases
B-tree
Data Warehouse
Historical Data
Hot Spot
Aggregation
Transform
Processing
Interval
Temporal aggregation
Evaluate
Experiments
Experiment

Keywords

  • Databases
  • Temporal aggregation
  • Temporal databases

ASJC Scopus subject areas

  • Statistics and Probability
  • Electrical and Electronic Engineering
  • Statistics, Probability and Uncertainty
  • Information Systems and Management
  • Information Systems
  • Computer Science Applications
  • Artificial Intelligence

Cite this

An efficient method for temporal aggregation with range-condition attributes. / Kang, Sung Tak; Chung, Yon Dohn; Kim, Myoung Ho.

In: Information Sciences, Vol. 168, No. 1-4, 03.12.2004, p. 243-265.

Research output: Contribution to journalArticle

Kang, Sung Tak ; Chung, Yon Dohn ; Kim, Myoung Ho. / An efficient method for temporal aggregation with range-condition attributes. In: Information Sciences. 2004 ; Vol. 168, No. 1-4. pp. 243-265.
@article{e388ef7b7ff14f4bba3af9d9f115beb2,
title = "An efficient method for temporal aggregation with range-condition attributes",
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.",
keywords = "Databases, Temporal aggregation, Temporal databases",
author = "Kang, {Sung Tak} and Chung, {Yon Dohn} and Kim, {Myoung Ho}",
year = "2004",
month = "12",
day = "3",
doi = "10.1016/j.ins.2004.02.024",
language = "English",
volume = "168",
pages = "243--265",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",
number = "1-4",

}

TY - JOUR

T1 - An efficient method for temporal aggregation with range-condition attributes

AU - Kang, Sung Tak

AU - Chung, Yon Dohn

AU - Kim, Myoung Ho

PY - 2004/12/3

Y1 - 2004/12/3

N2 - 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.

AB - 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.

KW - Databases

KW - Temporal aggregation

KW - Temporal databases

UR - http://www.scopus.com/inward/record.url?scp=9544253898&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=9544253898&partnerID=8YFLogxK

U2 - 10.1016/j.ins.2004.02.024

DO - 10.1016/j.ins.2004.02.024

M3 - Article

AN - SCOPUS:9544253898

VL - 168

SP - 243

EP - 265

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 1-4

ER -