A temporal aggregation method for update-intensive applications

Tak Kang Sung, Dohn Chung Yon, 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

Keywords

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

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Hardware and Architecture
  • Library and Information Sciences
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'A temporal aggregation method for update-intensive applications'. Together they form a unique fingerprint.

  • Cite this