Approximate Temporal Aggregation with Nearby Coalescing

详细信息    查看全文

• 关键词：Temporal aggregation ; Temporal coalescing ; Interval ; valued timestamp ; Coalescibility
• 刊名：Lecture Notes in Computer Science
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：9828
• 期：1
• 页码：426-433
• 全文大小：1,491 KB
• 参考文献：1.Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11), 832–843 (1983)CrossRef MATH
  2.Kline, N., Snodgrass, R.T.: Computing temporal aggregates. In: Proceedings of the Eleventh International Conference on Data Engineering, pp. 222–231, 06–10 March 1995
  3.Böhlen, M.H., Snodgrass, R.T., Soo, M.D.: Coalescing in temporal databases. In: Proceedings of the 22th International Conference on Very Large Data Bases (VLDB 1996), San Francisco, CA, USA, pp. 180–191 (1996)
  4.Kriegel, H.-P., Ptke, M., Seidl, T.: Managing intervals efficiently in object-relational databases. In: Proceedings of the 26th International Conference on Very Large Data Bases, pp. 407–418. Morgan Kaufmann Publishers Inc. (2000)
  5.Lopez, I.F.V., Snodgrass, R.T., Moon, B.: Spatiotemporal aggregate computation: a survey. IEEE Trans. Knowl. Data Eng. 17(2), 271–286 (2005)CrossRef
  6.Böhlen, M.H., Gamper, J., Jensen, C.S.: Multi-dimensional aggregation for temporal data. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 257–275. Springer, Heidelberg (2006)CrossRef
  7.de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry. Springer, Heidelberg (2008). (3rd revised edn.)CrossRef MATH
  8.Dyreson, C.E.: Temporal coalescing with now granularity, and incomplete information. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data (SIGMOD 2003), NY, USA, pp. 169–180 (2003)
  9.Gordevic̆ius, J., Gamper, J., Böhlen, M.: Parsimonious temporal aggregation. VLDB J. Int. J. Very Large Data Bases 21(3), 309–332 (2012)CrossRef
  
• 作者单位：Kai Cheng (15)
  
  15. Faculty of Information Science, Kyushu Sangyo University, 2-3-1, Mtsukadai, Higashi-ku, Fukuoka, 813-8503, Japan
  
• 丛书名：Database and Expert Systems Applications
• ISBN：978-3-319-44406-2
• 刊物类别：Computer Science
• 刊物主题：Artificial Intelligence and Robotics
  Computer Communication Networks
  Software Engineering
  Data Encryption
  Database Management
  Computation by Abstract Devices
  Algorithm Analysis and Problem Complexity
  
• 出版者：Springer Berlin / Heidelberg
• ISSN：1611-3349
• 卷排序：9828

文摘

Temporal aggregation is an important query operation in temporal databases. Although the general forms of temporal aggregation have been well researched, some new applications such as online calendaring systems call for new temporal aggregation. In this paper, we study the issue of approximate temporal aggregation with nearby coalescing, which we call NSTA. NSTA improves instant temporal aggregation by coalescing nearby (not necessarily adjacent) intervals to produce more compact and concise aggregate results. We introduce the term of coalescibility and based on it we develop efficient algorithms to compute coalesced aggregates. We evaluate the proposed methods experimentally and verify the feasibility.