Skip to main content

Semantic Load Shedding for Prioritized Continuous Queries over Data Streams

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 3733)


A data stream management system (DSMS) has to handle high-volume and bursty data streams with large number of continuous queries. When an input rate of any data stream exceeds the system capacity, the DSMS has to shed load by dropping some fraction of unprocessed data items. In this paper, we propose a new load shedding algorithm for continuous queries over data streams. Unlike previous algorithms assuming that all queries are equally important, we consider the priority of each query so that more important queries make more convincing outputs. As a result, the proposed algorithm can support differentiated quality of services by exploiting semantics inherent to applications. We also report the experiment results confirming the benefits of the proposed algorithm.


This research was supported by University IT Research Center Project.

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

Buying options

USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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

Learn about institutional subscriptions


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  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. VLDB J. 12(2), 120–139 (2003)

    Article  Google Scholar 

  2. Arasu, A., Babcock, B., Babu, S., McAlister, J., Widom, J.: Characterizing Memory Requirements for Queries over Continuous Data Streams. ACM Trans. Database Syst. 29(1), 162–194 (2004)

    Article  Google Scholar 

  3. Ayad, A., Naughton, J.: Static Optimization of Conjunctive Queries with Sliding Windows over Infinite Streams. In: Proc. ACM SIGMOD, pp. 419–430 (2004)

    Google Scholar 

  4. Babcock, B., Babu, S., Datar, M., Motwani, R., Widow, J.: Models and Issues in Data Stream Systems. In: Proc. ACM PODS, pp. 1–16 (2002)

    Google Scholar 

  5. Babcock, B., Datar, M., Motwani, R.: Load Shedding for Aggregation Queries over Data Streams. In: Proc. 20th ICDE, pp. 1–12 (2004)

    Google Scholar 

  6. Chandrasekaran, S., Franklin, M.: PSoup: A System for Streaming Queries over Streaming Data. VLDB J. 12(2), 140–156 (2003)

    Article  Google Scholar 

  7. Das, A., Gehrke, J., Riedewald, M.: Approximate Join Processing over Data Streams. In: Proc. ACM SIGMOD, pp. 40–51 (2003)

    Google Scholar 

  8. Gehrke, J. (ed.): Special Issue on Data Stream Processing. IEEE Data Eng. Bull (2003)

    Google Scholar 

  9. Kang, T., Naughton, J., Viglas, S.: Evaluating Window Joins over Unbounded Streams. In: Proc. 19th ICDE, pp. 341–352 (2003)

    Google Scholar 

  10. Schwetmann, H.: User’s Guide of CSIM18 Simulation Engine. Mesquite Software, Inc. (1996)

    Google Scholar 

  11. Tatbul, N., Cetintemel, U., Zdonik, S., Cherniack, M., Stonebraker, M.: Load Shedding in a Data Stream Manager. In: Proc. 29th VLDB Conf., pp. 309–320 (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations


Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Park, J., Cho, H. (2005). Semantic Load Shedding for Prioritized Continuous Queries over Data Streams. In: Yolum, p., Güngör, T., Gürgen, F., Özturan, C. (eds) Computer and Information Sciences - ISCIS 2005. ISCIS 2005. Lecture Notes in Computer Science, vol 3733. Springer, Berlin, Heidelberg.

Download citation

  • DOI:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29414-6

  • Online ISBN: 978-3-540-32085-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics