Abstract
Parsimonious temporal aggregation (PTA) has been introduced to overcome limitations of previous temporal aggregation operators, namely to provide a concise yet data sensitive summary of temporal data. The basic idea of PTA is to first compute instant temporal aggregation (ITA) as an intermediate result and then to merge similar adjacent tuples in order to reduce the final result size. The best known algorithm to compute a correct PTA result is based on dynamic programming (DP) and requires \(\mathcal {O}(n^2)\) space to store a so-called split point matrix, where n is the size of the intermediate data. The matrix stores the split points between which the intermediate tuples are merged.
In this paper, we propose two optimizations of the DP algorithm for PTA queries. The first optimization is termed diagonal pruning and identifies regions of the matrix that need not to be computed. This reduces the runtime complexity. The second optimization addresses the space complexity. We observed that only a subset of the elements in the split point matrix are actually needed. Therefore, we propose to replace the split point matrix by a so-called split point graph, which stores only those split points that are needed to restore the optimal PTA solution. This step reduces the memory consumption. An empirical evaluation shows the effectiveness of the two optimizations both in terms of runtime and memory consumption.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
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)
Dignös, A., Böhlen, M.H., Gamper, J.: Temporal alignment. In: SIGMOD, pp. 433–444 (2012)
Gamper, J., Böhlen, M.H., Jensen, C.S.: Temporal aggregation. In: Liu, L., Özsu, M.T. (eds.) Encyclopedia of Database Systems, pp. 2924–2929. Springer, Heidelberg (2009)
Gordevicius, J., Gamper, J., Böhlen, M.H.: Parsimonious temporal aggregation. In: EDBT, pp. 1006–1017 (2009)
Gordevicius, J., Gamper, J., Böhlen, M.H.: Parsimonious temporal aggregation. VLDB J. 21(3), 309–332 (2012)
Hirschberg, D.S.: Algorithms for the longest common subsequence problem. J. ACM 24(4), 664–675 (1977)
Kline, N., Snodgrass, R.T.: Computing temporal aggregates. In: ICDE, pp. 222–231 (1995)
Lorentzos, N.A.: Period-stamped temporal models. In: Liu, L., Özsu, M.T. (eds.) Encyclopedia of Database Systems, pp. 2094–2098. Springer, Heidelberg (2009)
Moon, B., Lopez, I.F.V., Immanuel, V.: Efficient algorithms for large-scale temporal aggregation. IEEE Trans. Knowl. Data Eng. 15(3), 744–759 (2003)
Myers, E.W., Miller, W.: Optimal alignments in linear space. Comput. Appl. Biosci. 4(1), 11–17 (1988)
Navathe, S.B., Ahmed, R.: A temporal relational model and a query language. Inf. Sci. 49(1–3), 147–175 (1989)
Snodgrass, R.T. (ed.): The TSQL2 Temporal Query Language. Kluwer, Norwell (1995)
Snodgrass, R.T.: Developing Time-Oriented Database Applications in SQL. Morgan Kaufmann, San Francisco (1999)
Snodgrass, R.T., Gomez, S., McKenzie, L.E.: Aggregates in the temporal query language TQuel. IEEE Trans. Knowl. Data Eng. 5(5), 826–842 (1993)
Tao, Y., Papadias, D., Faloutsos, C.: Approximate temporal aggregation. In: ICDE, pp. 190–201 (2004)
Tuma, P.: Implementing Historical Aggregates in TempIS. Ph.D. thesis, Wayne State University, Detroit, Michigan (1992)
Lopez, V.I.F., Snodgrass, R.T., Moon, B.: Spatiotemporal aggregate computation: A survey. IEEE Trans. Knowl. Data. Eng. 17(2), 271–286 (2005)
Wang, F.: Employee temporal data set (2009). http://timecenter.cs.aau.dk/
Yang, J., Widom, J.: Incremental computation and maintenance of temporal aggregates. VLDB J. 12(3), 262–283 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Mahlknecht, G., Dignös, A., Gamper, J. (2015). Efficient Computation of Parsimonious Temporal Aggregation. In: Tadeusz, M., Valduriez, P., Bellatreche, L. (eds) Advances in Databases and Information Systems. ADBIS 2015. Lecture Notes in Computer Science(), vol 9282. Springer, Cham. https://doi.org/10.1007/978-3-319-23135-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-23135-8_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23134-1
Online ISBN: 978-3-319-23135-8
eBook Packages: Computer ScienceComputer Science (R0)