Browse > Article
http://dx.doi.org/10.3745/KIPSTD.2008.15-D.2.163

WT-Heuristics: An Efficient Filter Operator Ordering Technology in Stream Data Environments  

Min, Jun-Ki (한국기술교육대학교 인터넷미디어공학부)
Abstract
Due to the proliferation of the Internet and intranet, a new application domain called stream data processing has emerged. Stream data is real-timely and continuously generated. 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-Heuristics. WT-Heuristics efficiently determines the operator execution order since it considers only two adjacent operators in the operator execution order. Also, our method changes the execution order with respect to the change of data characteristics with minimum overheads.
Keywords
Stream Data; Operator Order;
Citations & Related Records
연도 인용수 순위
  • Reference
1 T. Brinkhoff, H. Kriegel, R. Scheneider, B. Seeger, “The R*-tree: An Effcient and Robust Access Method for Points and Rectangles,” In Proceedings of ACM SIGMOD Conference, pp.322-331, 1990
2 H. S. Lim, J. G. Lee, M. J. Lee, K. Y. Whang, I. Y. Song, “Continuous query processing in data streams using duality of data and queries,” In Proceedings of ACM SIGMOD Conference, pp.313-324, 2006
3 H. M. Deitel, “An Introduction to Operating Systems,” Addison-Wesley, 1990
4 B. Babcock, S. Babu, M. Datar, R. Motwani, “Chain : Operator scheduling for memory minimization in data stream systems,” In Proceedings of ACM SIGMOD Conference, pp.253-264, 2003
5 D. Carney, U. Cetintemel, A. Rasin, S. B. Zdonik, M. Cherniack, M. Stonebraker, “Operator scheduling in a data stream manager,” In Proceedings of VLDB Conference, pp.838-849, 2003
6 R. Avnur, J. M. Hellerstein, “Eddies: Continuously adaptive query processing,” In Proceedings of ACM SIGMOD Conference, pp.261-272, 2000
7 W. Pugh, “Skip lists: A probabilistic alternative to balanced trees,” Communication of ACM, Vol.33, No.6, pp.668-676, 1990   DOI
8 J. M. Hellerstein, M. J. Franklin, S. Chandrasekaran, A. Deshpande, K. Hildrum, S. Madden, V. Raman, V., M. A. Shah, “Adaptive query processing: Technology in evolution,” IEEE Data Engineering Bulletin, Vol.23, No.2, pp.7-18, 2000
9 C. Cortes, K. Fisher, D. Pregibon, A. Rogers, “Hancock: a language for extracting signatures from data streams,” In Proceedings in ACM SIGKDD Conference, pp.9-17, 2000
10 A. Arasu, B. Babcock, S. Babu, M. Datar, K. Ito, R. Motwani, I. Nishizawa, U. Srivastava, D. Thomas, R. Varma, J. Widom, J., “Stream: The stanford stream data manager,” IEEE Data Engineering Bulletin, Vol.26, No.1, pp.19-26, 2003
11 S. Babu, R. Motwani, K. Munagala, I. Nishizawa, J. Widom, “Adaptive ordering of pipelined stream filters,” In Proceedings of ACM SIGMOD Conference, pp.407- 418, 2004
12 F. Fabret, H. A. Jacobsen, F. Llirbat, J. Pereira, K. A. Ross, D. Shasha, “Filtering algorithms and implementation for very fast publish/subscribe,” In Proceedings of ACM SIGMOD Conference, pp.115-126, 2001
13 K. A. Ross, “Conjunctive selection conditions in main memory,” In Proceedings of PODS Conference, pp.109- 120, 2002
14 Niagara Project (http://www.cs.wis.edu/niagara)
15 D. Carney, U. Cetintemel, M. Cherniack, C. Convey, S. Lee, G. Seidman, M. Stonebraker, N. Tatbul, S. B. Zdonik, “Monitoring streams - a new class of data management applications,” In Proceedings of VLDB Conference, pp. 215-226, 2002
16 J. Chen, D. J. DeWitt, F. Tian, Y. Wang, “Niagaracq: A scalable continuous query system for internet databases,” In Proceedings of ACM SIGMOD Conference, pp.379-390, 2000
17 S. Chandrasekaran, O. Cooper, A. Deshpande, M. J. Franklin, J. M. Hellerstein, W. Hong, S. Krishnamurthy, S. Madden, F. Reiss, M. A. Shah, “Telegraphcq: Continuous dataflow processing,” In Proceedings of ACM SIGMOD Conference, pp.668, 2003
18 D. Terry, D. Goldberg, D. Nichols, B. Oki, “Continuously Queries over Append-Only Databases,” In Proceedings of ACM SIGMOD Conference, 1992