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

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö > Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö ¼ÒÇÁÆ®¿þ¾î ¹× µ¥ÀÌÅÍ °øÇÐ

Á¤º¸Ã³¸®ÇÐȸ ³í¹®Áö ¼ÒÇÁÆ®¿þ¾î ¹× µ¥ÀÌÅÍ °øÇÐ

Current Result Document : 5 / 175 ÀÌÀü°Ç ÀÌÀü°Ç   ´ÙÀ½°Ç ´ÙÀ½°Ç

ÇѱÛÁ¦¸ñ(Korean Title) µ¥ÀÌÅͺ£À̽º¿¡¼­ À¯»çµµ ÁúÀÇ Ã³¸® ºñ¿ë °¨¼Ò ¹æ¹ý
¿µ¹®Á¦¸ñ(English Title) A Method of Reducing the Processing Cost of Similarity Queries in Databases
ÀúÀÚ(Author) ±è¼±°æ   ¹ÚÁö¼ö   ¼ÕÁø°ï   Sunkyung Kim   Ji Su Park   Jin Gon Shon  
¿ø¹®¼ö·Ïó(Citation) VOL 11 NO. 04 PP. 0157 ~ 0162 (2022. 04)
Çѱ۳»¿ë
(Korean Abstract)
¿À´Ã³¯ ´ëºÎºÐÀÇ µ¥ÀÌÅÍ´Â µ¥ÀÌÅͺ£À̽º(database: DB)¿¡ ÀúÀåµÈ´Ù. ÀÌ·¯ÇÑ DB ȯ°æ¿¡¼­ »ç¿ëÀÚ´Â ÀÚ½ÅÀÌ ¿øÇÏ´Â µ¥ÀÌÅ͸¦ ã¾ÆÁÙ °ÍÀ» DB¿¡°Ô ¿äûÇÏ°Ô µÈ´Ù. DB ÁúÀÇ Áß À¯»çµµ ÁúÀÇ´Â DB »ç¿ëÀÚ°¡ ¿øÇÏ´Â Á¶°ÇÀ¸·Î À¯»çµµ°¡ Æ÷ÇԵǾî ÀÖ´Â °ÍÀ» ¸»ÇÑ´Ù. ±×·¯³ª À¯»çµµ ÁúÀǸ¦ ó¸®Çϱâ À§ÇÑ °úÁ¤Àº ó¸® ·¹ÄÚµåÀÇ ¹üÀ§¸¦ ÁÙÀÏ ¼ö ÀÖ´Â »öÀÎÀ» ÀÌ¿ëÇϱâ Èûµé¾î Å×À̺íÀÇ Àüü ·¹Äڵ忡 ´ëÇؼ­ ¸Å¹ø À¯»çµµ¸¦ °è»êÇÏ´Â ºñ¿ëÀÌ ³ô´Ù. º» ³í¹®Àº ÀÌ·¯ÇÑ ¹®Á¦Á¡À» ÇØ°áÇϱâ À§ÇÏ¿© °æ·® À¯»çµµ ÇÔ¼ö¸¦ Á¤ÀÇÇÑ´Ù. °æ·® À¯»çµµ ÇÔ¼ö´Â À¯»çµµ ÇÔ¼ö¿¡ ºñÇØ µ¥ÀÌÅ͸¦ ¿©°úÇÏ´Â Á¤È®µµ´Â ¶³¾îÁöÁö¸¸ ºñ¿ëÀÌ À¯»çµµ ÇÔ¼ö¿¡ ºñÇÏ¿© Àû°Ô ¼Ò¸ðµÇ´Â Ư¡ÀÌ ÀÖ´Ù. ÀÌ·¯ÇÑ °æ·® À¯»çµµ ÇÔ¼öÀÇ Æ¯Â¡À» ÀÌ¿ëÇÏ¿© À¯»çµµ ÁúÀÇ Ã³¸® ºñ¿ë °¨¼Ò ¹æ¹ýÀ» Á¦½ÃÇÑ´Ù. ±×¸®°í À¯Å¬¸®µå °Å¸® ÇÔ¼ö¿¡ °æ·® À¯»çµµ ÇÔ¼ö·Î üºñ¼îÇÁ °Å¸®¸¦ Á¦½ÃÇÏ°í ±âÁ¸ÀÇ À¯»çµµ ÇÔ¼ö¸¦ ÀÌ¿ëÇÏ´Â ÁúÀÇ¿Í °æ·® À¯»çµµ ÇÔ¼ö¸¦ ÀÌ¿ëÇÏ´Â ÁúÀÇÀÇ Ã³¸® ºñ¿ëÀ» ºñ±³ÇÑ´Ù. ±×¸®°í ½ÇÇèÀ» ÅëÇÏ¿© À¯Å¬¸®µå À¯»çµµ¿¡ ´ëÇÑ °æ·® À¯»çµµ ÇÔ¼ö·Î üºñ¼îÇÁ °Å¸®¸¦ Àû¿ëÇÏ¿´À» ¶§ À¯»çµµ ÁúÀÇ Ã³¸® ºñ¿ëÀÌ °¨¼ÒÇÏ´Â °ÍÀ» È®ÀÎÇÑ´Ù.
¿µ¹®³»¿ë
(English Abstract)
Today, most data is stored in a database (DB). In the DB environment, the users requests the DB to find the data they wants. Similarity Query has predicate that explained by a similarity. However, in the process of processing the similarity query, it is difficult to use an index that can reduce the range of processed records, so the cost of calculating the similarity for all records in the table is high each time. To solve this problem, this paper defines a lightweight similarity function. The lightweight similarity function has lower data filtering accuracy than the similarity function, but consumes less cost than the similarity function. We present a method for reducing similarity query processing cost by using the lightweight similarity function features. Then, Chebyshev distance is presented as a lightweight similarity function to the Euclidean distance function, and the processing cost of a query using the existing similarity function and a query using the lightweight similarity function is compared. And through experiments, it is confirmed that the similarity query processing cost is reduced when Chebyshev distance is applied as a lightweight similarity function for Euclidean similarity.
Å°¿öµå(Keyword) À¯»çµµ   °æ·® À¯»çµµ   À¯»çµµ ÁúÀÇ   µ¥ÀÌÅͺ£À̽º   Similarity   Lightweight Similarity   Similarity Query   Database  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå