Skip to main content

Processing Sliding Window Join Aggregate in Continuous Queries over Data Streams

  • Conference paper
Advances in Databases and Information Systems (ADBIS 2004)

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

Abstract

Processing continuous queries over unbounded streams require unbounded memory. A common solution to this issue is to restrict the range of continuous queries into a sliding window that contains the most recent data of data streams. Sliding window join aggregates are often-used queries in data stream applications. The processing method to date is to construct steaming binary operator tree and pipeline execute. This method consumes a great deal of memory in storing the sliding window join results, therefore it isn’t suitable for stream query processing. To handle this issue, we present a set of novel sliding window join aggregate operators and corresponding realized algorithms, which achieve memory-saving and efficient performance. Because the performances of proposed algorithms vary with the states of data streams, a scheduling strategy is also investigated to maximize the processing efficiency. The algorithms in this paper not only can process the complex sliding window join aggregate, but also can process the multi-way sliding window join aggregate.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J.: Models and Issues in Data Stream Systems. In: Proc. ACM SIGACT SIGMOD Symp.on Principles of Database Systems, pp. 1–16 (2002)

    Google Scholar 

  2. Yao, Y., Gehrke, J.: Query Processing in Sensor Networks. In: Proc. 1st Biennial Conf. On Innovative Data Syst. Res (CIDR), pp. 233–244 (2003)

    Google Scholar 

  3. Carney, D., Cetintemel, U., Cherniack, M., Convey, C., Lee, S., Seidman, G., Stonebraker, M., Tatbul, N., Zdonik, S.: Monitoring streams-A New Class of Data Management Applications. In: Proc. 28th Int. Conf. on Very Large Data Bases, pp. 215–226 (2002)

    Google Scholar 

  4. Madden, S., Shah, M., Hellerstein, J.M., Raman, V.: Continuously Adaptive Continuous Queries over Streams. In: SIGMOD, pp. 49–60 (2002)

    Google Scholar 

  5. Chandrasekaran, S., Franklin, M.J.: Streaming Queries over Streaming Data. In: Proc. 28th Int. Conf. on Very Large Data Bases, pp. 203–214 (2002)

    Google Scholar 

  6. Arasu, A., Babcock, B., Babu, S., McAlister, J., Widom, J.: Characterizing Memory Requirements for Queries over Continuous Data Streams. In: Proc. ACM SIGACT-SIGMOD Symp.on Principles of Database Systems, pp. 221–232 (2002)

    Google Scholar 

  7. Arasu, A., Babu, S., Widom, J.: An Abstract Semantics and Concrete Language for Continuous Queries over Streams and Relations. Stanford University Technical Report 2002-57, November (2002)

    Google Scholar 

  8. Manku, G.S., Motwani, R.: Approximate Frequency Counts over Data Streams. In: Proc. 28th Int. Conf. on Very Large Data Bases, pp. 346–357 (2002)

    Google Scholar 

  9. Gehrke, J., Korn, F., Srivastava, D.: On Computing Correlated Aggregates over Continual Data Streams. In: Proc. of the 2001 ACM SIGMOD Intl. Conf. on Management of Data (September 2001)

    Google Scholar 

  10. Dobra, A., Gehrke, J., Garofalakis, M., Rastogi, R.: Processing complex aggregate queries over data streams. In: Proc. of the 2002 ACM SIGMOD Intl. Conf. on Management of Data (2002)

    Google Scholar 

  11. Wilschut, N., Apers, P.M.G.: Dataflow Query Execution in a Parallel Main-Memory Environment. In: PDIS, pp. 68–77 (1991)

    Google Scholar 

  12. Datar, M., Gionis, A., Indyk, P., Motwani, R.: Maintaining Stream Statistics over Sliding Windows. In: Proc. 13th SIAM-ACM Symposium on Discrete Algorithms, pp. 635–644 (2002)

    Google Scholar 

  13. Haas, P.J., Hellerstein, J.M.: Ripple Joins for Online Aggregation. In: SIGMOD Conference 1999, pp. 287–298 (1999)

    Google Scholar 

  14. Kang, J., Naughton, J.F., Viglas, S.D.: Evaluating Window Joins over Unbounded Streams. In: ICDE Conference (2003)

    Google Scholar 

  15. Golab, L., Tamer Ozsu, M.: Processing Sliding Window Multi-Joins in Continuous Queries over Data Streams. Waterloo University Technical Report CS-2003-01 (February 2003)

    Google Scholar 

  16. Viglas, S.D., Naughton, J.F., Burger, J.: Maximizing the Output Rate of Multi-Way Join Queries over Streaming Information Sources. In: Proc. of the 2003 Intl. Conf. on Very Large Data Bases (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

Wang, W., Li, J., Zhang, D., Guo, L. (2004). Processing Sliding Window Join Aggregate in Continuous Queries over Data Streams. In: BenczĂşr, A., Demetrovics, J., Gottlob, G. (eds) Advances in Databases and Information Systems. ADBIS 2004. Lecture Notes in Computer Science, vol 3255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30204-9_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30204-9_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23243-8

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics