• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ÇÐȸÁö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ÇÐȸÁö > µ¥ÀÌÅͺ£À̽º ¿¬±¸È¸Áö(SIGDB)

µ¥ÀÌÅͺ£À̽º ¿¬±¸È¸Áö(SIGDB)

Current Result Document : 986 / 986

ÇѱÛÁ¦¸ñ(Korean Title) ½Ã°ø°£ ¿¬¼ÓÁúÀÇ Ã³¸® ±ÔÄ¢ÀÇ °í¼Ó ½ÇÇàÀ» À§ÇÑ RETE ³ëµåÀÇ Çؽà À妽Ì
¿µ¹®Á¦¸ñ(English Title) Hash indexing on RETE nodes for fast executing of spatiotemporal continuous query processing rules
ÀúÀÚ(Author) ¹«Çϸ¶µå ÇϺñºÎ¸£ ¶ó¸¸   È«ºÀÈñ   ±è¿ìÂù   Muhammad Habibur Rahman   Bonghee Hong   Woochan Kim  
¿ø¹®¼ö·Ïó(Citation) VOL 37 NO. 02 PP. 0021 ~ 0036 (2021. 08)
Çѱ۳»¿ë
(Korean Abstract)
ÀÌ ³í¹®Àº ¿¬¼ÓÀûÀ¸·Î ¼öÁýµÇ´Â Ç¥Àû°´Ã¼µéÀÇ ¿©°ú, ºÐ·ù, ºÐ¼®, ´ëÀÀÀ» À§ÇÑ ½Ã°ø°£ ¿¬¼ÓÁúÀÇ Ã³¸® ±ÔÄ¢¿¡ ´ëÇÑ Çؽà À妽º¸¦ Á¦¾ÈÇÑ´Ù. ±ÔÄ¢ ±â¹Ý º¹ÇÕ À̺¥Æ® ó¸®ÀÇ ¼º´É °³¼±À» À§ÇÑ RETE ±â¹ýÀº ±ÔÄ¢¿¡ ´ëÇÑ ÄÄÆÄÀÏµÈ µ¥ÀÌÅÍ ±¸Á¶¸¦ »ý¼ºÇϱ⠶§¹®¿¡ ±ÔÄ¢ÀÇ Çؼ® ¹æ½Äº¸´Ù ¿ì¼öÇÑ ¼º´ÉÀ» º¸¿©ÁØ´Ù. ±ÔÄ¢µéÀÇ °³¼ö°¡ Áõ°¡ÇÒ ¶§ RETE ±â¹ýÀº ÀԷµǴ ½ºÆ®¸² µ¥ÀÌÅÍ¿¡ ´ëÇÏ¿© ÇØ´ç ±ÔÄ¢À» Ž»öÇØ¾ß ¿À¹öÇìµå ¶§¹®¿¡ ¼º´ÉÀÌ ¶³¾îÁö´Â ´ÜÁ¡ÀÌ ÀÖ´Ù. ÀÌ ³í¹®Àº ½Ã°ø°£ ¿¬¼ÓÁúÀÇ ±ÔÄ¢µéÀ» Ç¥ÇöÇÑ RETE ³ëµåµé¿¡ ´ëÇÏ¿© ½Ã°ø°£ »öÀÎÀ» ¸¸µé°í, ½ºÆ®¸² µ¥ÀÌÅÍ¿¡ ´ëÇÑ Çؽà À妽ÌÀ¸·Î ÇØ´ç ±ÔÄ¢ÀÇ RETE ³ëµå¸¦ ½ºÅºùÇÏ´Â ¹æ¹ýÀ¸·Î ±ÔÄ¢ÀÇ Å½»ö ¿À¹öÇìµå¸¦ ¾ø¾Ö´Â ¼º´É °³¼± ¹æ¹ýÀ» Á¦¾ÈÇÑ´Ù. RETE ±â¹ýÀÇ Drool°ú ºñ±³ ¼º´É ½ÇÇèÀ» ÅëÇÏ¿© RETE ³ëµåÀÇ ½Ã°ø°£ »öÀΠó¸® ¹æ¹ýÀÇ ¼º´ÉÀÌ ÃÖ¼Ò 18% ÀÌ»ó ¿ì¼öÇÔÀ» º¸ÀδÙ.
¿µ¹®³»¿ë
(English Abstract)
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 because it creates a compiled data structure for the rule. When the number of rules increases, the RETE technique has a disadvantage in that the performance is degraded due to the overhead of searching for the corresponding rule for the input stream data. This paper proposes a performance improvement method that eliminates rule search overhead by creating a spatiotemporal index for RETE nodes expressing spatiotemporal continuity query rules and stabbing the RETE node of the rule by hash indexing on stream data. Through the comparison performance experiment with Drool of the RETE method, it is shown that the performance of the spatiotemporal index processing method of the RETE node outperforms the existing Drool by at least 18%.
Å°¿öµå(Keyword) ±ÔĢ󸮠  ¿¬¼ÓÁúÀÇ   ½Ã°ø°£ÁúÀÇ   º¹ÇÕ À̺¥Æ®   »öÀΠ  rule processing   continuous query   spatiotemporal query   complex event   index  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå