Abstract
In this paper, we focus on the processing of stream data whose characteristics vary unpredictably by over time. Particularly, we suggest a method which generates an efficient operator execution order called WT-Heuristic. Our method changes the execution order with respect to the change of data characteristics with minimum overheads.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Avnur, R., Hellerstein, J.M.: Eddies: Continuously adaptive query processing. In: Proceedings of ACM SIGMOD Conference, pp. 261–272 (2000)
Babu, S., Motwani, R., Munagala, K., Nishizawa, I., Widom, J.: Adaptive ordering of pipelined stream filters. In: Proceedings of ACM SIGMOD Conference, pp. 407–418 (2004)
Fabret, F., Jacobsen, H.-A., Llirbat, F., Pereira, J., Ross, K.A., Shasha, D.: Filtering algorithms and implementation for very fast publish/subscribe. In: Proceedings of ACM SIGMOD Conference, pp. 115–126 (2001)
Ross, K.A.: Conjunctive selection conditions in main memory. In: Proceedings of PODS Conference, pp. 109–120 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Min, JK. (2007). WT-Heuristics: A Heuristic Method for Efficient Operator Ordering. In: Kotagiri, R., Krishna, P.R., Mohania, M., Nantajeewarawat, E. (eds) Advances in Databases: Concepts, Systems and Applications. DASFAA 2007. Lecture Notes in Computer Science, vol 4443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71703-4_87
Download citation
DOI: https://doi.org/10.1007/978-3-540-71703-4_87
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71702-7
Online ISBN: 978-3-540-71703-4
eBook Packages: Computer ScienceComputer Science (R0)