Abstract
Query execution and optimization for streaming data revisits almost all aspects of query execution and optimization over traditional, disk-bound database systems. The reason is that two fundamental assumptions of disk-bound systems are dropped: (i) the data resides on disk, and (ii) the data is finite. As such, new evaluation algorithms and new optimization metrics need to be devised. The approaches can be broadly classified into two categories. First, there are static approaches that follow the traditional optimize-then-execute paradigm by assuming that optimization-time assumptions will continue to hold during execution; the environment is expected to be relatively static in that respect. Alternatively, there are adaptive approaches that assume the environment is completely dynamic and highly unpredictable. In this chapter we explore both approaches and present novel query optimization and evaluation techniques for queries over streaming sources.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avnur, Ron and Hellerstein, Joseph M. (2000). Eddies: Continuously Adaptive Query Processing. In SIGMOD Conference.
Ayad, Ahmed and Naughton, Jeffrey F. (2004). Static Optimization of Conjunctive Queries with Sliding Windows over Unbounded Streaming Information Sources. In SIGMOD Conference.
Babcock, Brian, Babu, Shivnath, Datar, Mayur, and Motwani, Rajeev (2003). Chain: Operator Scheduling for Memory Minimization in Data Stream Systems. In SIGMOD Conference.
Bertsekas, D. and Gallager, R. (1991). Data Networks. Prentice Hall.
Golab, Lukasz and Ozsu, M. Tamer (2003). Processing sliding window multi-joins in continuous queries over data streams. In VLDB Conference.
Kang, Jaewoo, Naughton, Jeffrey F., and Viglas, Stratis D. (2003). Evaluating Window Joins over Unbounded Streams. In Proceedings of the International Conference on Data Engineering (ICDE).
Madden, Sam, Shah, Mehul A., Hellerstein, Joseph M., and Raman, Vijayshankar (2002). Continuously Adaptive Continuous Queries over Streams. In SIGMOD Conference.
Selinger, Patricia G., Astrahan, Morton M., Chamberlin, Donald D., Lorie, Raymond A., and Price, Thomas G. (1979). Access Path Selection in a Relational Database Management System. In SIGMOD Conference.
Shapiro, Leonard D. (1986). Join Processing in Database Systems with Large Main Memories. TODS, 11(3):239–264.
Tatbul, Nesime, Cetintemel, Ugur, Zdonik, Stanley B., Cherniack, Mitch, and Stonebraker, Michael (2003). Load Shedding in a Data Stream Manager. In VLDB Conference.
Urhan, Tolga and Franklin, Michael J. (2000). XJoin: A Reactively-Scheduled Pipelined Join Operator. IEEE Data Engineering Bulletin, 23(2):27–33.
Urhan, Tolga, Franklin, Michael J., and Amsaleg, Laurent (1998). Cost-Based Query Scrambling for Initial Delays. In SIGMOD Conference.
Viglas, Stratis D. and Naughton, Jeffrey F. (2002). Rate-Based Query Optimization for Streaming Information Sources. In SIGMOD Conference.
Viglas, Stratis D., Naughton, Jeffrey F., and Burger, Josef (2003). Maximizing the Output Rate of Multi-Way Join Queries over Streaming Information Sources. In VLDB Conference.
Wilschut, Annita N. and Apers, Peter M. G. (1991). Pipelining in Query Execution. In Conference on Databases, Parallel Architectures and their Applications.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Viglas, S.D. (2005). Query Execution and Optimization. In: Chaudhry, N.A., Shaw, K., Abdelguerfi, M. (eds) Stream Data Management. Advances in Database Systems, vol 30. Springer, Boston, MA. https://doi.org/10.1007/0-387-25229-0_2
Download citation
DOI: https://doi.org/10.1007/0-387-25229-0_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-24393-1
Online ISBN: 978-0-387-25229-2
eBook Packages: Computer ScienceComputer Science (R0)