A Performance Evaluation of Temporal Aggregate Query Processing


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 5, No. 7, pp. 1671-1679, Jul. 1998
10.3745/KIPSTE.1998.5.7.1671,   PDF Download:

Abstract

Temporal databases support an efficient historical representation and operation for an object in the real world. Especially, temporal aggregates generate an additional information by means of computations from objects that is valid at past as well as current time. It is one of important areas to serve to users as various type of aggregates as possible so that they enhance the overall system performance and efficiency. In this paper, we not only introduce temporal aggregate tree strategy as an efficient processing technique for given temporal aggregate query, but also analyze the overall processing cost and then evaluate its performance.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. D. Ho, L. J. Yun, R. K. Ho, L. I. Hong, "A Performance Evaluation of Temporal Aggregate Query Processing," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 5, no. 7, pp. 1671-1679, 1998. DOI: 10.3745/KIPSTE.1998.5.7.1671.

[ACM Style]
Kim Dong Ho, Lee Jong Yun, Ryu Keun Ho, and Lee In Hong. 1998. A Performance Evaluation of Temporal Aggregate Query Processing. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 5, 7, (1998), 1671-1679. DOI: 10.3745/KIPSTE.1998.5.7.1671.