Journal of KIISE:Databases (한국정보과학회논문지:데이타베이스)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Efficient Processing of Temporal Aggregation including Selection Predicates

선택 프레디키트를 포함하는 시간 집계의 효율적 처리

  • Published : 2008.06.15
Download PDF
⟨ Previous Next ⟩

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 selection predicates, 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.

시간지원 데이타베이스 시스템에서의 시간 집계 연산은 일반적인 집계 연산의 확장으로써, 집계의 범위 조건에 '시간'을 포함한다. 시간 집계 연산은 이력 데이타 웨어하우스, 전화 기록 관리(CDR) 등에 유용하다. 본 논문에서는 질의 조건에 여러 개의 선택 프레디키트들을 포함하는 시간 집계 연산을 효율적으로 처리하기 위한 자료 구조인 ITA-tree를 제안하고, 이를 이용한 시간 집계 처리 기법을 제안한다. ITA-tree에서는 레코드의 시간 구간을 T-value라는 하나의 값으로 변환한 후, $B^+$-tree와 비슷하게 이 값을 이용하여 색인을 생성한다. 또한, 많은 레코드가 동일한 T-value 값을 가지게 되는 핫-스팟 문제를 위해 개선된 ITA-tree인 eITA-tree를 제안한다. 본 논문에서는 제안된 기법들의 성능을 분석과 실험을 통해 비교한다.

Keywords

References

  1. G.Ozsoyoglu and R.T.Snodgrass. Temporal and Real-Time Databases: A Survey. IEEE Transactions on Knowledge and Data Engineering, Vol.7, No.4, pages 513-532, 1995 https://doi.org/10.1109/69.404027
  2. H.Gregersen, and C.S.Jensen. Temporal Entity-Relationship Models - A Survey. Technical Report R-96-2039, Aalborg University, 1996
  3. J.Melton. SQL/Temporal. July 1996. (ISO/IEC JTC 1/SC 21/WG 3 DBL-MCI-0012.)
  4. R.T.Snodgrass, I.Ahn, G.Ariav and et al. The TSQL2 Temporal Query Language. Kluwer Academic Publishers, 1995
  5. C.Dyreson, W.Evans, H.Lin and R.T.Snodgrass. Efficiently supporting Temporal Granularities. IEEE Transactions on Knowledge and Data Engineering, Vol. 12, No. 4, pages 568-587, 2000 https://doi.org/10.1109/69.868908
  6. J.S.Kim and M.H.Kim. An Effective Data Clustering Measure for Temporal Selection and Projection Queries. Decision Support Systems, Vol. 30, No. 1, pages 33-50, 2000 https://doi.org/10.1016/S0167-9236(00)00088-9
  7. M.D.Soo, R.T.Snodgrass and C.S.Jensen. Efficient Evaluation of the Valid-Time Natural Join. Proceedings of the International Conference on Data Engineering, pages 282-292, 1994
  8. B.Salzberg and V.J.Tsotras. A Comparison of Access Methods for Time Evolving Data. ACM Computing Surveys, Vol. 31, Issue. 2, pages 158-221, 1997 https://doi.org/10.1145/319806.319816
  9. V.J.Tsotras, B.Gopinath and G.W.Hart. Efficient Management of Time-Evolving Databases. IEEE Transactions of Knowledge and Data Engineering, Vol. 7, No. 4, pages 591-608, 1995 https://doi.org/10.1109/69.404032
  10. K.Torp, C.S.Jensen and R.T.Snodgrass. Effective Timestamping in Databases. Journal of Very Large Data Bases. Vol. 8, Issue. 3, pages 267-288, 2000 https://doi.org/10.1007/s007780050008
  11. V.J.Tsotras, N.Kangelaris. The Snapshot Index: An I/O-optimal access method for timeslice queries. Journal of Information Systems, Vol. 20, No. 3, pages 237-260, 1995 https://doi.org/10.1016/0306-4379(95)00011-R
  12. J.A.G.Gendrano, B.C.Huang, J.M.Rodrigue, B.Moon and R.T.Snodgrass. Parallel Algorithms for Computing Temporal Aggregates. International Conference on Data Engineering, pages 418-427, 1999
  13. J.S.Kim, S.T.kang and M.H.Kim, On Temporal Aggregate Processing based on Time Points. Journal of Korea Information Science Society (KISS), p.1418-1427, Vol.26, No.12, 1999
  14. N.Kline, and R.T.Snodgrass. Computing Temporal Aggregates. International Conference on Database Engineering, pages 222-231, 1995
  15. B.Moon, I.F.V.Lopez and V.Immanuel. Efficient Algorithms for Large Temporal Aggregation. IEEE Transactions on Knowledge and Data Engineering, Vol. 15, No. 3, pages 744-759, 2003 https://doi.org/10.1109/TKDE.2003.1198403
  16. R.T.Snodgrass, S.Gomez and L.E.McKlenzie. Aggregates in the temporal query language TQuel. IEEE Transaction on Knowledge and Data Engineering, Vol. 5, No. 5, pages 826-842, October 1993 https://doi.org/10.1109/69.243512
  17. P.A.Tuma. Implementing Historical Aggregates in TempIS. Master's Thesis, Wayne State University, Nov. 1992
  18. X.Ye and J.A.Keane. Processing Temporal Aggregates in Parallel. International Conference on Systems, Man, and Cybernetics, pages 1373-1378, 1997
  19. J.Yang and J.Widom, Incremental Computation and Maintenance of Temporal Aggregates. International Conference on Data Engineering, pages 51-60, 2001
  20. D.Zhang, A.Markowetz, V.Tsotras, D.Gunopulos and B.Seeger. Efficient Computation of Temporal Aggregates with Range Predicates. Principles of Database Systems, 2001
  21. B.Seeger and H.P.Kriegal. Techniques for Design and Implementation of Efficient Spatial Access Methods. International Conference on Very Large Data Bases, pages 360-371, 1988
  22. H.K.Park, S.T.kang, M.H.Kim and K.W.Min. On Indexing Method for Current Positions of Moving Objects. Journal of the Korea Open GIS Association,Vol. 5, No. 1, P. 65-74. 2003, 6
  23. J.W.Song, K.Y.Whang, Y.K.Lee, M.J.Lee and S.W.Kim. Spatial Join Processing Using Corner Transformation. IEEE Transactions of Knowledge and Data Engineering, Vol. 11, No. 4, pages 688-695, 1999 https://doi.org/10.1109/69.790844
  24. V.Gaede and O.Gunther. Multidimensional Access Methods. ACM Computing Surveys. Vol. 30, Issue. 2, pages 170-231, 1998 https://doi.org/10.1145/280277.280279