Window Specification over Data Streams

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


Several query languages have been proposed for managing data streams in modern monitoring applications. Continuous queries expressed in these languages usually employ windowing constructs in order to extract finite portions of the potentially unbounded stream. Explicitly or not, window specifications rely on ordering. Usually, timestamps are attached to all tuples flowing into the system as a means to provide ordered access to data items. Several window types have been implemented in stream prototype systems, but a precise definition of their semantics is still lacking. In this paper, we describe a formal framework for expressing windows in continuous queries over data streams. After classifying windows according to their basic characteristics, we give algebraic expressions for the most significant window types commonly appearing in applications. As an essential step towards a stream algebra, we then propose formal definitions for the windowed analogs of typical relational operators, such as join, union or aggregation, and we identify several properties useful to query optimization.


Data Stream Continuous Query Window Query Window State Stream Element 
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.
    Abadi, D.J., Carney, D., Çetintemel, U., Cherniack, M., Convey, C., Lee, S., Stonebraker, M., Tatbul, N., Zdonik, S.: Aurora: a New Model and Architecture for Data Stream Management. VLDB Journal 12(2), 120–139 (2003)CrossRefGoogle Scholar
  2. 2.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)zbMATHGoogle Scholar
  3. 3.
    Arasu, A., Babu, S., Widom, J.: The CQL Continuous Query Language: Semantic Foundations and Query Execution. VLDB Journal (to appear, 2006)Google Scholar
  4. 4.
    Ayad, A., Naughton, J.: Static Optimization of Conjunctive Queries with Sliding Windows over Data Streams. In: ACM SIGMOD, June 2004, pp. 419–430 (2004)Google Scholar
  5. 5.
    Arasu, A., Widom, J.: A Denotational Semantics for Continuous Queries over Streams and Relations. ACM SIGMOD Record 33(3), 6–12 (2004)CrossRefGoogle Scholar
  6. 6.
    Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and Issues in Data Stream Systems. In: ACM PODS, May 2002, pp. 1–16 (2002)Google Scholar
  7. 7.
    Barbarà, D.: The Characterization of Continuous Queries. International Journal of Cooperative Information Systems 8(4), 295–323 (1999)CrossRefGoogle Scholar
  8. 8.
    Chandrasekaran, S., Cooper, O., Deshpande, A., Franklin, M.J., Hellerstein, J.M., Hong, W., Krishnamurthy, S., Madden, S.R., Raman, V., Reiss, F., Shah, M.A.: TelegraphCQ: Continuous Dataflow Processing for an Uncertain World. In: CIDR, Asilomar, California (January 2003)Google Scholar
  9. 9.
    Dayal, U., Goodman, N., Katz, R.H.: An Extended Relational Algebra with Control over Duplicate Elimination. In: ACM PODS, March 1982, pp. 117–123 (1982)Google Scholar
  10. 10.
    Golab, L., Tamer Özsu, M.: Update-Pattern-Aware Modeling and Processing of Continuous Queries. In: ACM SIGMOD, June 2005, pp. 658–669 (2005)Google Scholar
  11. 11.
    Hammad, M., Aref, W., Franklin, M., Mokbel, M., Elmagarmid, A.: Efficient Execution of Sliding Window Queries over Data Streams. Technical Report CSD-TR-03-035, Purdue University (2003)Google Scholar
  12. 12.
    Jensen, C.S., Snodgrass, R.T.: Temporal Data Management. IEEE Transactions on Knowledge and Data Engineering 11(1), 36–44 (1999)CrossRefGoogle Scholar
  13. 13.
    Johnson, T., Muthukrishnan, S., Shkapenyuk, V., Spatscheck, O.: A Heartbeat Mechanism and its Application in Gigascope. In: VLDB, September 2005, pp. 1079–1088 (2005)Google Scholar
  14. 14.
    Krämer, J., Seeger, B.: A Temporal Foundation for Continuous Queries over Data Streams. In: COMAD, January 2005, pp. 70–82 (2005)Google Scholar
  15. 15.
    Li, J., Maier, D., Tufte, K., Papadimos, V., Tucker, P.A.: Semantics and Evaluation Techniques for Window Aggregates in Data Streams. In: ACM SIGMOD, June 2005, pp. 311–322 (2005)Google Scholar
  16. 16.
    Maier, D., Li, J., Tucker, P., Tufte, K., Papadimos, V.: Semantics of Data Streams and Operators. In: ICDT, January 2005, pp. 37–52 (2005)Google Scholar
  17. 17.
    Patroumpas, K., Sellis, T.: Managing Trajectories of Moving Objects as Data Streams. In: STDBM, August 2004, pp. 41–48 (2004)Google Scholar
  18. 18.
    Seshadri, P., Livny, M., Ramakrishnan, R.: SEQ: A Model for Sequence Databases. In: ICDE, March 1995, pp. 232–239 (1995)Google Scholar
  19. 19.
    Terry, D.B., Goldberg, D., Nichols, D., Oki, B.M.: Continuous Queries over Append-only Databases. In: ACM SIGMOD, June 1992, pp. 321–330 (1992)Google Scholar
  20. 20.
    Tucker, P., Maier, D., Sheard, T., Fegaras, L.: Exploiting Punctuation Semantics in Continuous Data Streams. IEEE Transactions on Knowledge and Data Engineering 15(3), 555–568 (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Kostas Patroumpas
    • 1
  • Timos Sellis
    • 1
  1. 1.School of Electrical and Computer EngineeringNational Technical University of AthensHellas

Personalised recommendations