Skip to main content

Querying Sliding Windows Over Online Data Streams

  • Conference paper
Current Trends in Database Technology - EDBT 2004 Workshops (EDBT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3268))

Included in the following conference series:

Abstract

A data stream is a real-time, continuous, ordered sequence of items generated by sources such as sensor networks, Internet traffic flow, credit card transaction logs, and on-line financial tickers. Processing continuous queries over data streams introduces a number of research problems, one of which concerns evaluating queries over sliding windows defined on the inputs. In this paper, we describe our research on sliding window query processing, with an emphasis on query models and algebras, physical and logical optimization, efficient processing of multiple windowed queries, and generating approximate answers. We outline previous work in streaming query processing and sliding window algorithms, summarize our contributions to date, and identify directions for future work.

This research is partially supported by the Natural Sciences and Engineering Research Council of Canada.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abadi, D., Carney, D., Cetintemel, U., Cherniack, M., Convey, C., Lee, S., Stonebraker, M., Tatbul, N., Zdonik, S.: Aurora: A new model and architecture for data stream management. The VLDB Journal 12(2), 120–139 (2003)

    Article  Google Scholar 

  2. Arasu, A., Babu, S., Widom, J.: The CQL continuous query language: Semantic foundations and query execution. Technical Report 2003-67, Stanford University (2003)

    Google Scholar 

  3. Arasu, A., Widom, J.: Resource sharing in continuous sliding-window aggregates. Technical Report 2004-15, Stanford University (2004)

    Google Scholar 

  4. Ayad, A., Naughton, J.: Static optimization of conjunctive queries with sliding windows over unbounded streaming information sources. In: Proc. ACM SIGMOD Int. Conf. on Management of Data (2004)

    Google Scholar 

  5. Babcock, B., Datar, M., Motwani, R.: Load shedding for aggregation queries over data streams. In: Proc. 20th Int. Conf. on Data Engineering, pp. 350–361 (2004)

    Google Scholar 

  6. Babcock, B., Datar, M., Motwani, R., O’Callaghan, L.: Maintaining variance and k-medians over data stream windows. In: Proc. 22nd ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pp. 234–243 (2003)

    Google Scholar 

  7. Babum, S., Munagala, K., Widom, J., Motwani, R.: Adaptive caching for continuous queries. Technical Report 2004-24, Stanford University (2004)

    Google Scholar 

  8. Bulut, A., Singh, A.K.: SWAT: Hierarchical stream summarization. In: Proc. 19th Int. Conf. on Data Engineering, pp. 303–314 (2003)

    Google Scholar 

  9. Chandrasekaran, S., Cooper, O., Deshpande, A., Franklin, M.J., Hellerstein, J.M., Hong, W., Krishnamurthy, S., Madden, S., Raman, V., Reiss, F., Shah, M.: TelegraphCQ: Continuous dataflow processing for an uncertain world. In: Proc. 1st Biennial Conf. on Innovative Data Syst. Res., pp. 269–280 (2003)

    Google Scholar 

  10. Chandrasekaran, S., Franklin, M.J.: PSoup: A system for streaming queries over streaming data. The VLDB Journal 12(2), 140–156 (2003)

    Article  Google Scholar 

  11. Chen, J., DeWitt, D., Tian, F., Wang, Y.: NiagaraCQ: A scalable continuous query system for internet databases. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 379–390 (2000)

    Google Scholar 

  12. Cohen, E., Strauss, M.: Maintaining time-decaying stream aggregates. In: Proc. 22nd ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pp. 223–233 (2003)

    Google Scholar 

  13. Cortes, C., Fisher, K., Pregibon, D., Rogers, A., Smith, F.: Hancock: A language for extracting signatures from data streams. In: Proc. 6th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 9–17 (2000)

    Google Scholar 

  14. Cranor, C., Johnson, T., Spatscheck, O., Shkapenyuk, V.: Gigascope: High performance network monitoring with an SQL interface. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 647–651 (2003)

    Google Scholar 

  15. Das, A., Gehrke, J., Riedewald, M.: Approximate join processing over data streams. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 40–51 (2003)

    Google Scholar 

  16. Datar, M., Gionis, A., Indyk, P., Motwani, R.: Maintaining stream statistics over sliding windows. In: Proc. 13th SIAM-ACM Symp. on Discrete Algorithms, pp. 635–644 (2002)

    Google Scholar 

  17. Golab, L., DeHaan, D., Demaine, E., Lopez-Ortiz, A., Munro, J.I.: Identifying frequent items in sliding windows over online packet streams. In: Proc. ACM SIGCOMM Internet Measurement Workshop, pp. 173–178 (2003)

    Google Scholar 

  18. Golab, L., DeHaan, D., Lopez-Ortiz, A., Demaine, E.: Finding frequent items in sliding windows with multinomially-distributed item frequencies. In: Proc. 16th Int. Conf. on Scientific and Statistical Database Management (2004)

    Google Scholar 

  19. Golab, L., Garg, S., Özsu, M.T.: On indexing sliding windows over online data streams. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K., Ferrari, E. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 712–729. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  20. Golab, L., Özsu, M.T.: Issues in data stream management. ACM SIGMOD Record 32(2), 5–14 (2003)

    Article  Google Scholar 

  21. Golab, L., Özsu, M.T.: Processing sliding window multi-joins in continuous queries over data streams. In: Proc. 29th Int. Conf. on Very Large Data Bases, pp. 500–511 (2003)

    Google Scholar 

  22. Hammad, M., Aref, W., Elmagarmid, A.: Stream window join: Tracking moving objects in sensor-network databases. In: Proc. 15th Int. Conf. on Scientific and Statistical Database Management, pp. 75–84 (2003)

    Google Scholar 

  23. 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 

  24. Hammad, M., Franklin, M.J., Aref, W., Elmagarmid, A.: Scheduling for shared window joins over data streams. In: Proc. 29th Int. Conf. on Very Large Data Bases, pp. 297–308 (2003)

    Google Scholar 

  25. Kang, J., Naughton, J., Viglas, S.: Evaluating window joins over unbounded streams. In: Proc. 19th Int. Conf. on Data Engineering, pp. 341–352 (2003)

    Google Scholar 

  26. Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: The design of an acquisitional query processor for sensor networks. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 491–502 (2003)

    Google Scholar 

  27. Qiao, L., Agrawal, D., El Abbadi, A.: Supporting sliding window queries for continuous data streams. In: Proc. 15th Int. Conf. on Scientific and Statistical Database Management, pp. 85–94 (2003)

    Google Scholar 

  28. Shivakumar, N., García-Molina, H.: Wave-indices: Indexing evolving databases. In: Proc. ACM SIGMOD Int. Conf. on Management of Data, pp. 381–392 (1997)

    Google Scholar 

  29. Srivastava, U., Widom, J.: Flexible time management in data stream systems. In: Proc. 23rd ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems (2004)

    Google Scholar 

  30. Srivastava, U., Widom, J.: Memory-limited execution of windowed stream joins. Technical Report 2004-12, Stanford University (2004)

    Google Scholar 

  31. Sullivan, M., Heybey, A.: Tribeca: A system for managing large databases of network traffic. In: Proc. USENIX Annual Technical Conf. (1998)

    Google Scholar 

  32. Tucker, P., Maier, D., Sheard, T., Faragas, L.: Exploiting punctuation semantics in continuous data streams. IEEE Trans. Knowledge and Data Eng. 15(3), 555–568 (2003)

    Article  Google Scholar 

  33. Wilschut, A., Apers, P.: Dataflow query execution in a parallel main-memory environment. In: Proc. Int. Conf. on Parallel and Distributed Information Systems, pp. 68–77 (1991)

    Google Scholar 

  34. Zhu, Y., Rundensteiner, E., Heineman, G.: Dynamic plan migration for continuous queries over data streams. In: Proc. ACM SIGMOD Int. Conf. on Management of Data (2004)

    Google Scholar 

  35. Zhu, Y., Shasha, D.: StatStream: Statistical monitoring of thousands of data streams in real time. In: Proc. 28th Int. Conf. on Very Large Data Bases, pp. 358–369 (2002)

    Google Scholar 

  36. Zhu, Y., Shasha, D.: Efficient elastic burst detection in data streams. In: Proc. 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 336–345 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Golab, L. (2004). Querying Sliding Windows Over Online Data Streams. In: Lindner, W., Mesiti, M., Türker, C., Tzitzikas, Y., Vakali, A.I. (eds) Current Trends in Database Technology - EDBT 2004 Workshops. EDBT 2004. Lecture Notes in Computer Science, vol 3268. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30192-9_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30192-9_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23305-3

  • Online ISBN: 978-3-540-30192-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics