The KIPS Transactions:PartD (정보처리학회논문지D)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

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

WT-Heuristics: 스트림 데이터 환경에서의 효율적인 필터 연산자 순서화 기법

  • 민준기 (한국기술교육대학교 인터넷미디어공학부)
  • Published : 2008.04.30
Download PDF
⟨ Previous Next ⟩

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.

인터넷과 인트라넷의 확산에 따라, 스트림 데이터 처리 (stream data processing) 와 같은 새로운 분야가 등장하게 되었다. 스트림 데이터는 실시간적이고 연속적으로 생성된다. 본 논문에서는 시간에 따라서 예측할 수 없게 특성이 바뀌는 데이터 스트림에 대한 처리에 대하여 다룬다. 특별히, 본 논문에서는 스트림 데이터에 대한 질의문을 구성하는 연산자들 간의 효율적인 수행 순서 생성 기법인 WT-Heuristics를 제안한다. WT-Heuristics 기법은 연산 실행 순서에서 인접한 두 연산자들의 연산 순서만을 고려함으로써 효율적으로 연산자 순서를 결정할 수 있다. 또한 본 논문에서 제안하는 방법은 시스템의 부담을 적게 주면서도 데이터의 변화에 따라 수행 순서를 변화시킨다.

Keywords

References

  1. D. Terry, D. Goldberg, D. Nichols, B. Oki, “Continuously Queries over Append-Only Databases,” In Proceedings of ACM SIGMOD Conference, 1992
  2. 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
  3. Niagara Project (http://www.cs.wis.edu/niagara)
  4. 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
  5. 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
  6. 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
  7. 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
  8. 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
  9. K. A. Ross, “Conjunctive selection conditions in main memory,” In Proceedings of PODS Conference, pp.109- 120, 2002
  10. 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
  11. 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
  12. 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
  13. W. Pugh, “Skip lists: A probabilistic alternative to balanced trees,” Communication of ACM, Vol.33, No.6, pp.668-676, 1990 https://doi.org/10.1145/78973.78977
  14. 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
  15. H. M. Deitel, “An Introduction to Operating Systems,” Addison-Wesley, 1990
  16. 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
  17. 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
  18. R. Avnur, J. M. Hellerstein, “Eddies: Continuously adaptive query processing,” In Proceedings of ACM SIGMOD Conference, pp.261-272, 2000