Á¤º¸°úÇÐȸ ÄÄÇ»ÆÃÀÇ ½ÇÁ¦ ³í¹®Áö (KIISE Transactions on Computing Practices)
ÇѱÛÁ¦¸ñ(Korean Title) |
ÀÌÁ¾ ȯ°æ¿¡¼ ´ë¿ë·® RDF µ¥ÀÌÅ͸¦ À§ÇÑ µ¿Àû ºÐÇÒ ±â¹ý |
¿µ¹®Á¦¸ñ(English Title) |
Dynamic Partitioning Scheme for Large RDF Data in Heterogeneous Environments |
ÀúÀÚ(Author) |
±è¹Î¼ö
ÀÓÁ¾ÅÂ
º¹°æ¼ö
À¯Àç¼ö
Minsoo Kim
Jongtae Lim
Kyoungsoo Bok
Jaesoo Yoo
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 23 NO. 10 PP. 0605 ~ 0610 (2017. 10) |
Çѱ۳»¿ë (Korean Abstract) |
ºÐ»ê ȯ°æ¿¡¼ ƯÁ¤ ¼¹ö¿¡ ¹ß»ýÇÑ ºÎÇÏ ¶Ç´Â ¼¹ö °£ÀÇ Åë½ÅÀ¸·Î ¹ß»ýÇÑ ºÎÇϸ¦ ÇØ°áÇϱâ À§ÇÑ µ¿Àû ºÐÇÒÀÌ ÇÊ¿äÇÏ´Ù. ÀÌÁ¾ ȯ°æ¿¡¼ ±âÁ¸ µ¿Àû ºÐÇÒ ±â¹ýÀº ¹°¸®Àû ¼º´ÉÀÌ ÀÛÀº ¼¹ö¿¡µµ µ¿ÀÏÇÑ ºÎÇϸ¦ ºÐ¹èÇϹǷΠÁúÀÇ ÀÀ´ä½Ã°£ÀÌ ´Ê¾îÁö´Â ¹®Á¦°¡ ¹ß»ýÇÑ´Ù. º» ³í¹®¿¡¼´Â ÀÌÁ¾ ȯ°æ¿¡¼ ´ë¿ë·® RDFµ¥ÀÌÅ͸¦ À§ÇÑ µ¿Àû ºÐÇÒ ±â¹ýÀ» Á¦¾ÈÇÑ´Ù. Á¦¾ÈÇÏ´Â ±â¹ýÀº ºÎÇÏ ºÐ»êÀ» À§ÇØ ÁúÀÇ ºóµµ¼ö¿Í ÁúÀÇ¿¡ »ç¿ëµÈ Á¤Á¡ ¼ö¸¦ °¡Áö°í ÁúÀÇ ºÎÇϸ¦ °è»êÇÑ´Ù. ¶ÇÇÑ, ÀÌÁ¾ ȯ°æ¿¡¼ ¹°¸®Àû ¼º´ÉÀÌ ÀÛÀº ¼¹ö¿¡ ÀûÀº ºÎÇϸ¦ ÇÒ´çÇϱâ À§ÇÏ¿© ¼¹öµéÀÇ ¹°¸®Àû ¼º´ÉÀ» °í·ÁÇÑ ¼¹ö ºÎÇϸ¦ °è»êÇÑ´Ù. ºÎÇÏ ºÐ»ê ½Ã ¼¹ö °£ÀÇ Åë½Å·®À» ÁÙÀ̱â À§ÇØ °£¼± Àý´Ü ¼ö°¡ ÃÖ¼Ò°¡ µÇµµ·Ï µ¿Àû ºÐÇÒÀ» ¼öÇàÇÑ´Ù. ¼º´É Æò°¡¸¦ ÅëÇØ Á¦¾ÈÇÏ´Â µ¿ÀûºÐÇÒ ±â¹ýÀÌ ±âÁ¸ µ¿Àû ºÐÇÒ ±â¹ý¿¡ ºñÇØ ¿ì¼öÇÔÀ» ÀÔÁõÇÑ´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
In distributed environments, dynamic partitioning is needed to resolve the load on a particular server or the load caused by communication among servers. In heterogeneous environments, existing dynamic partitioning schemes can distribute the same load to a server with a low physical performance, which results in a delayed query response time. In this paper, we propose a dynamic partitioning scheme for large RDF data in heterogeneous environments. The proposed scheme calculates the query loads with its frequency and the number of vertices used in the query for load balancing. In addition, we calculate the server loads by considering the physical performance of the servers to allocate less of a load to the servers with a smaller physical performance in a heterogeneous environment. We perform dynamic partitioning to minimize the number of edge-cuts to reduce the traffic among servers. To show the superiority of the proposed scheme, we compare it with an existing dynamic partitioning scheme through a performance evaluation.
|
Å°¿öµå(Keyword) |
RDF
ºÎÇÏ ºÐ»ê
µ¿Àû ºÐÇÒ
ÀÌÁ¾ ȯ°æ
RDF
load balancing
dynamic partitioning
heterogeneous environment
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|