Àüü
ÀüÀÚ/Àü±â
Åë½Å
ÄÄÇ»ÅÍ
·Î±×ÀÎ
ȸ¿ø°¡ÀÔ
About Us
ÀÌ¿ë¾È³»
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
Æ÷Ä¿½ºiN
¿¬±¸ÀÚ Á¤º¸
¶óÀÌ¡½ºÅ¸
ÆÄ¿öiNÅͺä
¼¼ÁßÇÑ
¿¬±¸ÀÚ·á
¹®ÀÚ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñÁ¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
´Ý±â
»çÀÌÆ®¸Ê
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
ÄÄÇ»ÅÍiN
¿¬±¸ÀÚ Á¤º¸
¿¬±¸ÀÚ·á
¹®ÀÚ DB
Ȧ·Î±×·¥ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñ Á¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
IT Daily
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
¼ºñ½º ¹Ù·Î°¡±â
¼³¹®Á¶»ç
¿¬±¸À±¸®
°ü·Ã±â°ü
Please wait....
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±¹³» ³í¹®Áö
Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö >
Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö
>
Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)
Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)
Current Result Document :
1
/ 4
´ÙÀ½°Ç
ÇѱÛÁ¦¸ñ(Korean Title)
ÁýÇÕ ±â¹Ý À¯»ç ½ÃÄö½º ¸ÅĪÀÇ ¼º´É Çâ»óÀ» À§ÇÑ ÃÖÀûÈ ¹æ¹ý
¿µ¹®Á¦¸ñ(English Title)
An Optimization Method for Performance Improvement of Set-based Similar Sequence Matching
ÀúÀÚ(Author)
ÀÓÈ¿»ó
ÀÌÁÖ¿ø
Hyo-Sang Lim
Juwon Lee
¿ø¹®¼ö·Ïó(Citation)
VOL 45 NO. 04 PP. 0403 ~ 0407 (2018. 04)
Çѱ۳»¿ë
(Korean Abstract)
ÁýÇÕ À¯»ç ½ÃÄö½º ¸ÅĪ ¹æ¹ýÀº ±³ÁýÇÕ ±â¹ÝÀÇ À¯»çµµ¸¦ ÀÌ¿ëÇÏ¿© ÁúÀÇ ÁýÇÕ ½ÃÄö½º¿Í À¯»çÇÑ µ¥ÀÌÅÍ ÁýÇÕ ½ÃÄö½º¸¦ ã´Â´Ù. ±×·¯³ª ¼ö¸¹Àº ÁýÇÕ °£ÀÇ ±³ÁýÇÕ Å©±â¸¦ °è»êÇϴµ¥ ¼öÇà ½Ã°£ÀÌ ¿À·¡ °É¸®´Â ¼º´É»óÀÇ ¹®Á¦°¡ ÀÖ´Ù. º» ³í¹®ÀÇ ÀúÀÚµéÀº °£´ÜÇÑ ÁýÇÕ À妽º ±¸Á¶¸¦ »ç¿ëÇÑ ¼º´É Çâ»ó ¹æ¹ýÀ» Á¦½ÃÇÑ ¹Ù ÀÖ´Ù. º» ³í¹®Àº ºÒÇÊ¿äÇÑ ¿¬»êÀ» Á¦¿ÜÇÏ´Â ÇÁ·ç´×(pruning) ±â¹Ý ÃÖÀûÈ ¹æ¹ýÀ» Á¦½ÃÇÔÀ¸·Î½á, ±âÁ¸ ¹æ¹ýº¸´Ù È¿À²ÀûÀ¸·Î ÁýÇÕ ±â¹Ý À¯»ç ½ÃÄö½º ¸ÅĪÀ» ¼öÇàÇÒ ¼ö ÀÖ´Â ¹æ¹ý¿¡ ´ëÇØ Á¦¾ÈÇÑ´Ù. ¼º´É Æò°¡ °á°ú, Á¦¾ÈÇÏ´Â ¹æ¹ýÀÌ ±âÁ¸ ¹æ¹ý¿¡ ºñÇØ ¾à 20% Á¤µµÀÇ ¼öÇà ½Ã°£ °¨¼Ò°¡ ÀÖÀ½À» º¸ÀδÙ.
¿µ¹®³»¿ë
(English Abstract)
The set-based similar sequence matching method involves searching for data set sequences that are similar to a query set sequence. In the method, the similarity between two sets is represented as the size of intersection between them. However, there is a critical performances issue for calculating intersection size if the number of sets is large. In the past, authors of the present work proposed a method to improve the performance of set-based similar sequence matching using simple index structure. In this paper, we propose an optimization method for more efficient running of set-based similar sequence matching. Our method is based on pruning that excludes unnecessary calculation. Through experiments, we show that the proposed method reduces the execution time by about 20% compared to the existing methods.
Å°¿öµå(Keyword)
ÁýÇÕ
ÁýÇÕ À¯»çµµ
ÁýÇÕ ±â¹Ý À¯»ç ½ÃÄö½º ¸ÅĪ
ÃÖÀûÈ
set
set similarity
set-based similar sequence matching
optimization
ÆÄÀÏ÷ºÎ
PDF ´Ù¿î·Îµå
¸ñ·Ï
Copyright(c)
Computer Science Engineering Research Information Center
. All rights reserved.