Skip to main content

Efficient Sliding Window Join in Data Stream Processing

  • Conference paper
  • First Online:
Advanced Multimedia and Ubiquitous Engineering

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 354))

  • 1426 Accesses

Abstract

Our previous work compared two possible approaches to process sliding window join over continuous data streams. It showed that using multiple hash tables per stream source provided better performance than using a single hash table. On the other hand, performance of the single-table scheme can be improved by reducing the windowing cost to deal with expired tuples. In this paper, we discuss how to reduce the cost in the single-table scheme algorithm as a solution for efficient sliding window join.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Kim, H.G., Kim, M.H.: A review of window query processing for data streams. J. Comput. Sci. Eng. 7(4), 220–230 (2013)

    Article  Google Scholar 

  2. Fernandez, R., Migliavacca, M., Kalyvianaki, E., Pietzuch, E.: Integrating scale out and fault tolerance in stream processing using operator state management. In: Proceedings of the 2013 ACM SIGMOD, pp. 725–736 (2013)

    Google Scholar 

  3. Lam, W., et al.: Muppet: MapReduce-style processing of fast data. Proc. VLDB Endowment 5(12), 1814–1825 (2012)

    Article  Google Scholar 

  4. Zhang, R., et al.: A highly optimized algorithm for continuous intersection join queries over moving objects. VLDB J. 21, 561–586 (2012)

    Article  Google Scholar 

  5. Kim, H.G., Park, Y.H., Cho, Y.H., Kim, M.H.: Time-slide window join over data streams. J. Intell. Inf. Syst. 43, 323–347 (2014)

    Article  MathSciNet  Google Scholar 

  6. Kim, H.G.: A structure for sliding window equijoins in data stream processing. In: Proceedings of the 16th IEEE CSE, pp. 100–103 (2013)

    Google Scholar 

  7. Li, J., et al.: Semantics and evaluation techniques for window aggregates in data streams. In: Proceedings of the 2005 ACM SIGMOD, pp. 311–322 (2005)

    Google Scholar 

  8. Viglas, S.D., Naughton, J.F., Burger, J.: Maximizing the output rate of multi-way join queries over streaming information sources. In: Proceedings of the 29th VLDB Conference, pp. 285–296 (2003)

    Google Scholar 

  9. Kwon, T.H., Lee, K.Y., Kim, M.H.: Load shedding for multi-way stream joins based on arrival order patterns. J. Intell. Inf. Syst. 37, 245–265 (2011)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hyeon Gyu Kim .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kim, H.G. (2016). Efficient Sliding Window Join in Data Stream Processing. In: Park, J., Chao, HC., Arabnia, H., Yen, N. (eds) Advanced Multimedia and Ubiquitous Engineering. Lecture Notes in Electrical Engineering, vol 354. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47895-0_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-47895-0_45

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-47894-3

  • Online ISBN: 978-3-662-47895-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics