Earticle

초록

영어

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 ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  한국차세대컴퓨팅학회 학술대회

• 간기

  반년간

• 수록기간

  2021~2025

• 십진분류

  KDC 566 DDC 004