Online Amnesic Summarization of Streaming Locations

  • Michalis Potamias
  • Kostas Patroumpas
  • Timos Sellis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4605)


Massive data streams of positional updates become increasingly difficult to manage under limited memory resources, especially in terms of providing near real-time response to multiple continuous queries. In this paper, we consider online maintenance for spatiotemporal summaries of streaming positions in an aging-aware fashion, by gradually evicting older observations in favor of greater precision for the most recent portions of movement. Although several amnesic functions have been proposed for approximation of time series, we opt for a simple, yet quite efficient scheme that achieves contiguity along all retained stream pieces. To this end, we adapt an amnesic tree structure that effectively meets the requirements of time-decaying approximation while taking advantage of the succession inherent in positional updates. We further exemplify the significance of this scheme in two important cases: the first one refers to trajectory compression of individual objects; the other offers estimated aggregates of moving object locations across time. Both techniques are validated with comprehensive experiments, confirming their suitability in maintaining online concise synopses for moving objects.


Hash Function Temporal Extent Query Region Trajectory Segment Trajectory Approximation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arasu, A., Widom, J.: Resource Sharing in Continuous Sliding-Window Aggregates. In: VLDB, pp. 336–347 (2004)Google Scholar
  2. 2.
    Bettini, C., Dyreson, C.E., Evans, W.S., Snodgrass, R.T., Wang, X.S.: A Glossary of Time Granularity Concepts. In: Etzion, O., Jajodia, S., Sripada, S. (eds.) Temporal Databases: Research and Practice. LNCS, vol. 1399, pp. 406–413. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  3. 3.
    Bulut, A., Singh, A.K.: SWAT: Hierarchical Stream Summarization in Large Networks. In: ICDE, pp. 303–314 (2003)Google Scholar
  4. 4.
    Chen, Y., Dong, G., Han, J., Wah, B.W., Wang, J.: Multi-Dimensional Regression Analysis of Time-Series Data Streams. In: VLDB, pp. 323–334 (2002)Google Scholar
  5. 5.
    Cohen, E., Strauss, M.: Maintaining Time-Decaying Stream Aggregates. In: PODS, pp. 223–233 (2003)Google Scholar
  6. 6.
    Flajolet, P., Martin, G.N.: Probabilistic Counting Algorithms for Database Applications. Journal of Computer and Systems Sciences 31(2), 182–209 (1985)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Ganguly, S., Garofalakis, M., Rastogi, R.: Processing Set Expressions over Continuous Update Streams. In: SIGMOD, pp. 265–276 (2003)Google Scholar
  8. 8.
    Lazaridis, I., Mehrotra, S.: Progressive Approximate Aggregate Queries with a Multi-Resolution Tree Structure. In: SIGMOD, pp. 401–412 (2001)Google Scholar
  9. 9.
    Palpanas, T., Vlachos, M., Keogh, E., Gunopulos, D., Truppel, W.: Online Amnesic Approximation of Streaming Time Series. In: ICDE, pp. 338–349 (2004)Google Scholar
  10. 10.
    Potamias, M., Patroumpas, K., Sellis, T.: Sampling Trajectory Streams with Spatiotemporal Criteria. In: SSDBM, pp. 275–284 (2006)Google Scholar
  11. 11.
    Potamias, M., Patroumpas, K., Sellis, T.: Amnesic Online Synopses for Moving Objects. In: CIKM, pp. 784–785 (2006)Google Scholar
  12. 12.
    Tao, Y., Kollios, G., Considine, J., Li, F., Papadias, D.: Spatio-Temporal Aggregation Using Sketches. In: ICDE, pp. 214–226 (2004)Google Scholar
  13. 13.
    Zhang, D., Gunopulos, D., Tsotras, V.J., Seeger, B.: Temporal Aggregation over Data Streams using Multiple Granularities. In: Chaudhri, A.B., Unland, R., Djeraba, C., Lindner, W. (eds.) EDBT 2002. LNCS, vol. 2490, pp. 646–663. Springer, Heidelberg (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Michalis Potamias
    • 1
  • Kostas Patroumpas
    • 2
  • Timos Sellis
    • 2
  1. 1.Computer Science Department, Boston University, MAUSA
  2. 2.School of Electrical and Computer Engineering, National Technical University of Athens, Hellas 

Personalised recommendations