A temporal aggregation method for update-intensive applications

Tak Kang Sung, Yon Dohn Chung, Ho Kim Myoung

Research output: Contribution to journalArticle

Abstract

The temporal aggregation in temporal databases is an extension of the conventional aggregation including the time as a range condition of the aggregation. In this paper, we propose a new tree based structure for the temporal aggregation, called the CTA-tree. In the CTA-tree, we transform the time interval of a temporal data record into a value, called the T-value, using the Corner transformation and column-scan transformation. Then, we index the data records according to their T-values. Through analyses and experiments, we evaluate and compare the performance of the proposed method with the conventional method, and show the efficiency of the proposed method for the update-intensive applications.

Original languageEnglish
Pages (from-to)1175-1185
Number of pages11
JournalJournal of Information Science and Engineering
Volume24
Issue number4
Publication statusPublished - 2008 Jul 1

Fingerprint

aggregation
Agglomeration
Values
efficiency
experiment
performance
Experiments
time

Keywords

  • Corner transformation
  • Data structures
  • Databases
  • Temporal aggregation
  • Temporal databases

ASJC Scopus subject areas

  • Information Systems

Cite this

A temporal aggregation method for update-intensive applications. / Sung, Tak Kang; Chung, Yon Dohn; Myoung, Ho Kim.

In: Journal of Information Science and Engineering, Vol. 24, No. 4, 01.07.2008, p. 1175-1185.

Research output: Contribution to journalArticle

@article{695f10b2b0f3441c925fc0a94ecbb7a4,
title = "A temporal aggregation method for update-intensive applications",
abstract = "The temporal aggregation in temporal databases is an extension of the conventional aggregation including the time as a range condition of the aggregation. In this paper, we propose a new tree based structure for the temporal aggregation, called the CTA-tree. In the CTA-tree, we transform the time interval of a temporal data record into a value, called the T-value, using the Corner transformation and column-scan transformation. Then, we index the data records according to their T-values. Through analyses and experiments, we evaluate and compare the performance of the proposed method with the conventional method, and show the efficiency of the proposed method for the update-intensive applications.",
keywords = "Corner transformation, Data structures, Databases, Temporal aggregation, Temporal databases",
author = "Sung, {Tak Kang} and Chung, {Yon Dohn} and Myoung, {Ho Kim}",
year = "2008",
month = "7",
day = "1",
language = "English",
volume = "24",
pages = "1175--1185",
journal = "Journal of Information Science and Engineering",
issn = "1016-2364",
publisher = "Institute of Information Science",
number = "4",

}

TY - JOUR

T1 - A temporal aggregation method for update-intensive applications

AU - Sung, Tak Kang

AU - Chung, Yon Dohn

AU - Myoung, Ho Kim

PY - 2008/7/1

Y1 - 2008/7/1

N2 - The temporal aggregation in temporal databases is an extension of the conventional aggregation including the time as a range condition of the aggregation. In this paper, we propose a new tree based structure for the temporal aggregation, called the CTA-tree. In the CTA-tree, we transform the time interval of a temporal data record into a value, called the T-value, using the Corner transformation and column-scan transformation. Then, we index the data records according to their T-values. Through analyses and experiments, we evaluate and compare the performance of the proposed method with the conventional method, and show the efficiency of the proposed method for the update-intensive applications.

AB - The temporal aggregation in temporal databases is an extension of the conventional aggregation including the time as a range condition of the aggregation. In this paper, we propose a new tree based structure for the temporal aggregation, called the CTA-tree. In the CTA-tree, we transform the time interval of a temporal data record into a value, called the T-value, using the Corner transformation and column-scan transformation. Then, we index the data records according to their T-values. Through analyses and experiments, we evaluate and compare the performance of the proposed method with the conventional method, and show the efficiency of the proposed method for the update-intensive applications.

KW - Corner transformation

KW - Data structures

KW - Databases

KW - Temporal aggregation

KW - Temporal databases

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

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

M3 - Article

AN - SCOPUS:48849091966

VL - 24

SP - 1175

EP - 1185

JO - Journal of Information Science and Engineering

JF - Journal of Information Science and Engineering

SN - 1016-2364

IS - 4

ER -