earticle

논문검색

Poster Session I

Hash indexing on Rete nodes for efficient spatiotemporal continuous query rule processing

초록

영어

This paper proposes a hash index for spatiotemporal continuous query processing rules for filtering, classifying, analyzing, and responding to consecutively collected target objects. The Rete technique for improving the performance of rule-based complex event processing shows better performance than the rule interpretation method as it creates a compiled data structure for the rule. This paper proposes a performance improvement method that eliminates the rule search overhead by creating a spatiotemporal index for the Rete nodes expressing spatiotemporal continuity query rules and stabbing the Rete node of the rule by employing hash indexing on the stream data.

목차

Abstract
I. INTRODUCTION
II. SPATIOTEMPORAL CONTINUOUS QUERY RULE PROCESSING
III. PERFORMANCE COMPARISON EVALUATION TEST
IV. CONCLUSION AND FUTURE WORKS
ACKNOWLEDGMENT
REFERENCES

저자정보

  • Muhammad Habibur Rahman dept. of Computer Science and Engineering Pusan National university
  • Bonghee Hong dept. of Computer Science and Engineering Pusan National university
  • Dongjun Lim dept. of Computer Science and Engineering Pusan National university
  • Sanghyun Lee dept. of Computer Science and Engineering Pusan National university
  • Woochan Kim dept. of Computer Science and Engineering Pusan National university
  • Hari Setiawan dept. of Computer Science and Engineering Pusan National university

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      0개의 논문이 장바구니에 담겼습니다.