Previous 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

@

Journal of Information Science and Engineering, Vol. 24 No. 4, pp. 1175-1186 (July 2008)

A Temporal Aggregation Method for Update-Intensive Applications*

Sung Tak Kang, Yon Dohn Chung+ and Myoung Ho Kim
Department of Computer Science
Korea Advanced Institute of Science and Technology
Yusung-Gu, Daejon, 305-701, Korea
+Department of Computer Science and Engineering
Korea University
Seongbuk-Gu, Seoul, 136-713, Korea

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: temporal aggregation, corner transformation, data structures, temporal databases, databases

Full Text () Retrieve PDF document (200807_11.pdf)

Received June 2, 2006; revised November 6, 2007 & March 6, 2008; accepted March 13, 2008.
Communicated by Suh-Yin Lee.
*This work was supported by the Korea Science and Engineering Foundation (KOSEF) grant funded by the Korea government (MOST) (No. R0A-2007-000-10046-0).
+Corresponding author.