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

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö > Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö > Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)

Á¤º¸°úÇÐȸ³í¹®Áö (Journal of KIISE)

Current Result Document : 2 / 3

ÇѱÛÁ¦¸ñ(Korean Title) RDF Áö½Ä º£À̽ºÀÇ È¿À²ÀûÀÎ ÀÎÄÚµù ¹× ¾ÐÃà ±â¹ý
¿µ¹®Á¦¸ñ(English Title) Efficient Approach for Encoding and Compression of RDF Knowledge Bases
ÀúÀÚ(Author) ÅÏÁö³ª ¼Öź¾Æ   ÀÌ¿µ±¸   Tangina Sultana   Young-Koo Lee  
¿ø¹®¼ö·Ïó(Citation) VOL 49 NO. 03 PP. 0241 ~ 0249 (2022. 03)
Çѱ۳»¿ë
(Korean Abstract)
¿£Æ¼Æ¼ Á᫐ °Ë»ö ¹× ÀÚ¿¬¾î ±â¹Ý ÁúÀÇÀÇ ¾öû³­ ¼ºÀåÀ¸·Î ÀÎÇØ È°¿ë °¡´ÉÇÑ Áö½Ä º£À̽º (Knowledge Bases, KBs)ÀÇ Å©±â°¡ ±âÇϱ޼öÀûÀ¸·Î Áõ°¡ÇÏ¿´´Ù. µû¶ó¼­ ´ë¿ë·®ÀÇ µ¥ÀÌÅ͸¦ È¿À²ÀûÀ¸·Î°Ë»öÇÏ´Â SPARQL Äõ¸® °Ë»ö ¿£ÁøÀÌ ÇÊ¿äÇÏ´Ù. RDF ¿£ÁøÀº ÁÖ·Î Áö½Ä º£À̽º¸¦ °ü¸®Çϱâ À§ÇØ ¼ø¼­, ÁÂÇ¥, ±¸¹® ¹× Çؽà ±â¹Ý ÀÎÄÚµùÀ» »ç¿ëÇÑ´Ù. ±×·¯³ª ´ëºÎºÐÀÇ ±âÁ¸ ¹æ¹ý¿¡¼­´Â ´õ ÁÁÀº ¾ÐÃà·üÀ» º¸ÀÌÁö ¸øÇÏ°í, ÀûÀç ½Ã°£ÀÌ ´À¸®¸ç, ÁúÀÇ ¼º´ÉÀÌ È¿À²ÀûÀÌÁö ¾Ê´Ù. µû¶ó¼­ º» ³í¹®¿¡¼­´Â ´õ ³ôÀº ¾ÐÃà·üÀ» ´Þ¼ºÇÏ°í ¾ÐÃà ¹× ÀÎÄÚµùµÈ µ¥ÀÌÅÍ¿¡ ´ëÇÑ SPARQL Äõ¸®ÀÇ ¼º´ÉÀ» Çâ»ó½ÃÅ°±â À§ÇØ ºó¹ßÇÏ°í ÀǹÌÀûÀ¸·Î °ü·ÃµÈ ¿ë¾î¸¦ °¨ÁöÇÏ´Â Á¢±Ù ¹æ½ÄÀ» Á¦¾ÈÇÑ´Ù. ÀÌ ±â¹ýÀº Åë°è Á¤º¸¿Í Àǹ̷ÐÀû Á¢±ÙÀ» °áÇÕÇÑ Á¢±Ù ¹æ½ÄÀ¸·Î »çÀü ÀÎÄÚµù ¾Ë°í¸®ÁòÀ» ±â¹ÝÀ¸·Î ÇÑ´Ù. Àǹ̷ÐÀ» ±â¹ÝÀ¸·Î ÀÚÁÖ »ç¿ëµÇÁö ¾Ê´Â ¿ë¾î¸¦ ½Äº°ÇÏ´Â ½ºÅ°¸¶¸¦ µµÀÔÇß´Ù. ±×¸®°í ½Ã½ºÅÛÀº Àǹ̷ÐÀûÀ¸·Î °ü·ÃµÈ µ¥ÀÌÅ͸¦ ¿ÂÅç·ÎÁö Ŭ·¡½º·Î Á¶ÇÕÇÏ¿© ÇÊ¿äÇÑ ¸Þ¸ð¸® ÀûÀ縦 ÅëÇØ ·Îµù ½Ã°£À» ´õ¿í ÁÙ¿©ÁØ´Ù. ¿ì¸®´Â Á¦¾ÈµÈ ±â¹ýÀ» ±âÁ¸ÀÇ Á¢±Ù ¹æ½Ä°ú ½ÇÇèÀ» ÅëÇØ ºñ±³¸¦ ÁøÇàÇÏ°í, ½ÇÇè °á°ú ¿ì¸®°¡ Á¦¾ÈÇÑ Á¢±Ù ¹æ½ÄÀÌ ±âÁ¸ ½Ã½ºÅÛº¸´Ù Áö½Ä º£À̽º¸¦ ÈξÀ ´õ È¿°úÀûÀ¸·Î ¾ÐÃàÇÏ°í ÀÎÄÚµùÇÔÀ» È®ÀÎÇÑ´Ù.
¿µ¹®³»¿ë
(English Abstract)
Due to the enormous growth of entity-centric search and natural language-based queries, the applicability of Knowledge Bases (KBs) is increasing exponentially. Therefore, it requires efficient SPARQL queries. Resource Description Framework (RDF) engines mostly employ order, coordinates, syntactic, and hash-based encoding for managing KBs. However, most current schemes do not have a better compression ratio, faster loading time, or efficient query performance. To address these concerns, in this paper, we propose a novel approach for detecting frequent and semantically related terms to achieve a higher compression ratio and enhance the performance of SPARQL queries on compressed and encoded data. This scheme was based on a dictionary encoding algorithm, a combined approach of statistical and semantic schemes. We also introduced another scheme for identifying infrequent terms based on their semantics. The system then assembled semantically related data into ontological classes that could further reduce the required memory footprint as well as loading time. We analyzed and compared the performance of our proposed scheme with those of existing state-of-the-art approaches. The simulation result affirmed that our proposed approach compressed and encoded KBs substantially better than existing systems.
Å°¿öµå(Keyword) ¾ÐÃà   ÀÎÄÚµù   ±¸¹® ÀÎÄÚµù   Áö½Ä º£À̽º   compression   encoding   syntactic encoding   knowledge bases  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå