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

»çÀÌÆ®¸Ê

Loading..

Please wait....

±¹³» ³í¹®Áö

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

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

Current Result Document : 4 / 15 ÀÌÀü°Ç ÀÌÀü°Ç   ´ÙÀ½°Ç ´ÙÀ½°Ç

ÇѱÛÁ¦¸ñ(Korean Title) SparQLing : SparkSQL ±â¹Ý ´ë¿ë·® Æ®¸®Çà µ¥ÀÌÅ͸¦ À§ÇÑ SPARQL ÁúÀÇ ½Ã½ºÅÛ ±¸Ãà
¿µ¹®Á¦¸ñ(English Title) SparQLing : SparkSQL ±â¹Ý ´ë¿ë·® Æ®¸®Çà µ¥ÀÌÅ͸¦ À§ÇÑ SPARQL ÁúÀÇ ½Ã½ºÅÛ ±¸Ãà
ÀúÀÚ(Author) Àü¸íÁß   È«Áø¿µ   ¹Ú¿µÅà  MyungJoong Jeon   JinYoung Hong   YoungTack Park  
¿ø¹®¼ö·Ïó(Citation) VOL 43 NO. 04 PP. 0450 ~ 0459 (2016. 04)
Çѱ۳»¿ë
(Korean Abstract)
¸Å³â RDFS µ¥ÀÌÅÍ´Â ´ë¿ë·®È­ µÇ¾î °¡¸ç, ºü¸¥ ÁúÀǸ¦ À§ÇÑ SPARQL 󸮹æ½Ä¿¡ ´ëÇÑ º¯È­°¡ ÇÊ¿äÇÏ°Ô µÇ¾ú´Ù. À̸¦ À§ÇØ ´ë¿ë·® ºÐ»ê ó¸® ÇÁ·¹ÀÓ¿öÅ©¸¦ È°¿ëÇÑ SPARQLÀÇ ÁúÀÇ Ã³¸®¹æ½ÄÀÌ ¸¹ÀÌ ¿¬±¸µÇ°í ÀÖ´Ù. ±âÁ¸ÀÇ ¿¬±¸ Áß ´ë¿ë·® ºÐ»ê ó¸® ÇÁ·¹ÀÓ¿öÅ©ÀÎ Hadoop(MapReduce) ±â¹Ý ÁúÀÇ ¿£ÁøÀº ¹Ýº¹ÀûÀÎ ÀÛ¾÷À¸·Î ÀÎÇÑ ÀæÀº I/O ¹ß»ýÀ¸·Î ½Ç½Ã°£ ÁúÀÇ Ã³¸®°¡ ºÒ°¡´ÉÇϸç, Àθ޸𸮠±â¹Ý ºÐ»ê ÁúÀÇ ¿£Áø ¿ª½Ã ³·Àº ´Ü°èÀÇ ¾ð¾î ¼öÁØ¿¡¼­ ºÐ»ê ±¸Á¶¸¦ °í·ÁÇÑ ±¸ÇöÀÌ ÇÊ¿äÇϱ⠶§¹®¿¡ ÁúÀÇ ¿£Áø ±¸ÃàÀÌ ¾î·Æ´Ù. º» ³í¹®¿¡¼­´Â Àθ޸𸮠±â¹Ý ºÐ»ê ÁúÀÇ Ã³¸® ÇÁ·¹ÀÓ¿öÅ©ÀÎ SparkSQLÀ» È°¿ëÇÏ¿© ´ë¿ë·® Æ®¸®Çà µ¥ÀÌÅÍ¿¡ ´ëÇÑ SPARQL ÁúÀǹ® ó¸® ¼Óµµ¸¦ Çâ»ó½Ãų ¼ö ÀÖ´Â ÁúÀÇ Ã³¸® ¿£Áø ±¸Ãà ¹æ¹ýÀ» Á¦¾ÈÇÑ´Ù. SparkSQL Àº Spark ±â¹ÝÀÇ °í¼öÁØ ºÐ»ê ÁúÀÇ ¿£ÁøÀ¸·Î¼­ ±âÁ¸ÀÇ SQL¹®À» È°¿ëÇÑ ÁúÀÇ°¡ °¡´ÉÇÏ´Ù. µû¶ó¼­ SPARQL ÁúÀǹ®À» ó¸®Çϱâ À§Çؼ­´Â Jena¸¦ ÀÌ¿ëÇÏ¿© Algebra Tree¸¦ »ý¼ºÇÑ ÈÄ À̸¦ Spark ½Ã½ºÅÛ¿¡ Àû¿ëÇϱâ À§ÇÑ Spark Algebra Tree·Î º¯È¯ÇØ¾ß ÇÑ´Ù. ±×¸®°í À̸¦ ÀÌ¿ëÇÏ¿© SparkSQL ÁúÀǹ®À» »ý¼ºÇÏ´Â ½Ã½ºÅÛÀ» ±¸ÃàÇÏ¿´´Ù. ¶ÇÇÑ Spark Àθ޸𸮠½Ã½ºÅÛ¿¡¼­ º¸´Ù È¿À²ÀûÀÎ ÁúÀÇ Ã³¸®¸¦ À§ÇÑ DataFrame±â¹ÝÀÇ Æ®¸®Çà Property Å×ÀÌºí ¼³°è¸¦ Á¦¾ÈÇÏ°í SparkSQL ÇÁ·¹ÀÓ¿öÅ©¿¡ È°¿ëÇÏ¿´´Ù. ¸¶Áö¸·À¸·Î ±âÁ¸ÀÇ ºÐ»êó¸® ÇÁ·¹ÀÓ¿öÅ©¸¦ »ç¿ëÇÑ ÁúÀÇ ¿£Áø°ú ºñ±³ Æò°¡¸¦ ÅëÇÏ¿© ¿¬±¸ÀÇ Å¸´ç¼ºÀ» °ËÁõÇÑ´Ù.
¿µ¹®³»¿ë
(English Abstract)
Every year, RDFS data tends further toward scalability; hence, the manner of SPARQL processing needs to be changed for fast query. The query processing method of SPARQL has been studied using a scalable distributed processing framework. Current studies indicate that the query engine based on the scalable distributed processing framework i.e., Hadoop(MapReduce) is not suitable for real-time processing because of the repetitive tasks; in addition, it is difficult to construct a query engine based on an In-memory Distributed Query engine, because distributed structure on the low-level is required to be considered. In this paper, we proposed a method to construct a query engine for improving the speed of the query process with the mass triple data. The query engine processes the query of SPARQL using the SparkSQL, which is an In-memory based, distributed query processing framework. SparkSQL is a high-level distributed query engine that facilitates existing SQL statement. In order to process the SPARQL query, after generating the Algebra Tree using Jena, the Algebra Tree is required to be translated to Spark Algebra Tree for application in the Spark system, and construction of the system that generated the SparkSQL query. Furthermore, we proposed the design of triple property table based on DataFrame for more efficient query processing in the Spark system. Finally, we verified the validity through comparative evaluation with the query engine, which is the existing distributed processing framework.
Å°¿öµå(Keyword) Àθ޸𸮠±â¹Ý ºÐ»ê ÁúÀÇ ¿£Áø   RDFS   SPARQL   Spark   SparkSQL   Sempala   in-memory based distributed query engine   RDFS   SPARQL   spark   SparkSQL   sempala  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå