Skip to main content
Log in

Adaptive scheduling for shared window joins over data streams

  • Review Article
  • Published:
Frontiers of Computer Science in China Aims and scope Submit manuscript

Abstract

Recently a few Continuous Query systems have been developed to cope with applications involving continuous data streams. At the same time, numerous algorithms are proposed for better performance. A recent work on this subject was to define scheduling strategies on shared window joins over data streams from multiple query expressions. In these strategies, a tuple with the highest priority is selected to process from multiple candidates. However, the performance of these static strategies is deeply influenced when data are bursting, because the priority is determined only by static information, such as the query windows, arriving order, etc. In this paper, we propose a novel adaptive strategy where the priority of a tuple is integrated with realtime information. A thorough experimental evaluation has demonstrated that this new strategy can outperform the existing strategies.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

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

    Article  Google Scholar 

  2. Chandrasekaran S, Franklin M J. Streaming queries over streaming data. In: Proceedings of VLDB. Hong Kong: Morgan Kaufmann Publishers, 2002, 203–214

    Google Scholar 

  3. Hammad M A, Franklin M J, Aref W G, et al. Scheduling for shared window joins over data streams. In: Proceedings of VLDB. Berlin: Morgan Kaufmann Publishers, 2003, 297–308

    Google Scholar 

  4. Madden S, Shah M, Hellerstein J M, et al. Continuously adaptive continuous queries over streams. In: Proceedings of SIGMOD. Madison: ACM Press, 2002, 49–60

    Chapter  Google Scholar 

  5. Babcock B, Babu S, Datar M, et al. Models and issues in data stream systems. In: Proceedings of ACM SIGACT-SIGMOD Symp. on Principles of Database Systems. Madison: ACM Press, 2002, 1–16

    Google Scholar 

  6. Garofalakis M, Gehrke J, Rastogi R. Querying and mining data streams: you only get one look. In: Proceedings of SIGMOD. Madison: ACM Press, 2002, 635

    Chapter  Google Scholar 

  7. Carney D, Cetintemel U, Cherniack M, et al. Monitoring streams—a new class of data management applications. In: Proceedings of VLDB. Hong Kong: Morgan Kaufmann Publishers, 2002, 215–226

    Google Scholar 

  8. Chen J, DeWitt D J, Tian F, et al. Niagaracq: a scalable continuous query system for internet databases. In: Proceedings of SIGMOD. Dallas: ACM Press, 2000, 379–390

    Chapter  Google Scholar 

  9. Motwani R, Widom J, Arasu A, et al. Query processing, resource management, and approximation in a data stream management system. In: Proceedings of CIDR. Asilomar: Morgan Kaufman Publishers, 2003, 245–256

    Google Scholar 

  10. Chandrasekaran S, Cooper O, Deshpande A, et al. Telegraphcq: continuous dataflow processing for an uncertain world. In: Proceedings of CIDR. Asilomar: Morgan Kaufman Publishers, 2003, 269–280

    Google Scholar 

  11. Babcock B, Babu S, Datar M, et al. Chain: operator scheduling for memory minimization in stream systems. In: Proceedings of SIGMOD. San Diego: ACM Press, 2003, 253–264

    Google Scholar 

  12. Golab L, Bijay K G, Özsu M T. On concurrency control in sliding window queries over data streams. In: Proceedings of EDBT. Beilin: Springer-Verlag, 2006, 608–626

    Google Scholar 

  13. Golab L. Thesis: sliding window query processing over data streams. http://www.cs.uwaterloo.ca/research/tr/2006/CS-2006-27.pdf, 2006

  14. Zhang D, Li J, Kimeli K, et al. Sliding window based multi-join algorithms over distributed data streams. In: Proceedings of ICDE. Los Alamitos: IEEE Computer Society Press, 2006, 139

    Google Scholar 

  15. Avnur R, Hellerstein J M. Eddies: continuously adaptive query processing. In: Proceedings of SIGMOD. Dallas: ACM Press, 2000, 261–272

    Chapter  Google Scholar 

  16. Aref W G, Elmagarmid A K, Ali M H, et al. Nile: a query processing engine for data streams. In: Proceedings of ICDE. Boston: IEEE Computer Society Press, 2004, 851

    Google Scholar 

  17. Kang J, Naughton J F, Viglas S. Evaluating window joins over unbounded streams. In: Proceedings of ICDE. Los Alamitos: IEEE Computer Society Press, 2003, 341–352

    Google Scholar 

  18. Crovella M E, Taqqu M S, Bestavros A. Heavy-tailed probability distribution in the world wide web. In: A practical guide to heavy tails: statistical techniques and applications. New York: Birkhauser Boston Inc, 1998, 3–26

    Google Scholar 

  19. Tatbul N, Cetintemel U, Zdonik S, et al. Load shedding in a data stream manager. In: Proceedings of VLDB. Berlin: Morgan Kaufmann Publishers, 2003, 309–320

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhou Aoying.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jin, C., Zhou, A., Yu, J.X. et al. Adaptive scheduling for shared window joins over data streams. Front. Comput. Sc. China 1, 468–477 (2007). https://doi.org/10.1007/s11704-007-0046-8

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-007-0046-8

Keywords

Navigation