µ¥ÀÌÅͺ£À̽º ¿¬±¸È¸Áö(SIGDB)
ÇѱÛÁ¦¸ñ(Korean Title) |
SIMD ¾ÆÅ°ÅØó ±â¹ÝÀÇ È¿À²ÀûÀÎ Á¤·Ä ÇÕº´ Á¶ÀΠó¸® |
¿µ¹®Á¦¸ñ(English Title) |
Efficient Sort Merge Join Processing based on SIMD Architectures |
ÀúÀÚ(Author) |
°¼ºÇö
ÀÌÈƼø
±èâ¼ö
¹ÎÁرâ
Seonghyeon Kang
Hun Soon Lee
Chang soo Kim
Jun-Ki Min
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 32 NO. 02 PP. 0107 ~ 0118 (2016. 08) |
Çѱ۳»¿ë (Korean Abstract) |
SIMD(Single Instruction Multiple Data) ¾ÆÅ°ÅØó´Â ÇϳªÀÇ ¸í·É¾î·Î SIMD ·¹Áö½ºÅÍ¿¡ ´ã±ä ¿©·¯ µ¥ÀÌÅ͸¦ º¤ÅÍ¿Í °°Àº ÇüÅ·ΠÃë±ÞÇÏ¿© º´·ÄÀûÀ¸·Î µ¥ÀÌÅ͸¦ ó¸®ÇÏ´Â ¸í·É¾î ¼ÂÀ» °®´Â ¾ÆÅ°ÅØó¸¦ ¸»ÇÑ´Ù. ÇöÀç µ¥ÀÌÅͺ£À̽º¿¡¼ ´Ù¾çÇÑ ¿¬»ê󸮿¡ SIMD ¸í·É¾î ¼ÂÀ» È°¿ëÇÑ ¿¬±¸°¡ È°¹ßÈ÷ ÁøÇàµÇ°í ÀÖ´Ù. ƯÈ÷ °ü°èÇü µ¥ÀÌÅͺ£À̽º¿¡¼ Áß¿äÇÑ ¿¬»êÀÎ Á¶ÀÎÀº ºü¸¥ ¿¬»ê ¼öÇàÀ» À§ÇØ ¼º´É °³¼±ÀÌ Áß¿äÇÏ´Ù. ÀϹÝÀûÀ¸·Î Á¶ÀÎ ¿¬»êÀ¸·Î Çؽ¬Á¶ÀÎ(Hash Join)°ú Á¤·ÄÇÕº´Á¶ÀÎ(Sort Merge Join)ÀÌ ¸¹ÀÌ »ç¿ëµÇ¸ç, º» ³í¹®¿¡¼´Â CPU¿¡¼ ºÐ±â ¿¹Ãø ½ÇÆзΠÀÎÇÑ ¼º´É ÀúÇϸ¦ ÃÖ¼ÒÈÇÏ°í µ¥ÀÌÅÍ ¼öÁØ º´·Äȸ¦ È°¿ëÇϱâ À§ÇÏ¿© SIMD ¸í·É¾î ¼ÂÀ» »ç¿ëÇÑ ÇÕº´Á¶ÀÎ ±â¹ýÀ» Á¦½ÃÇÏ¿´À¸¸ç Á¦¾ÈÇÑ SIMD ¾Ë°í¸®ÁòÀ» ´ÙÁß ½º·¹µå ±¸Á¶·Î È®ÀåÇÏ¿© Á¶ÀÎ ¼º´ÉÀ» Çâ»ó½ÃÄ×´Ù. ¶ÇÇÑ, ´Ù¾çÇÑ È¯°æ¿¡¼ÀÇ ½ÇÇèÀ» ÅëÇÏ¿© º» ³í¹®¿¡¼ Á¦¾ÈÇÏ´Â SIMD ¾Ë°í¸®ÁòÀÇ È¿À²¼ºÀ» º¸¿´´Ù. |
¿µ¹®³»¿ë (English Abstract) |
SIMD(Single Instruction Multiple Data) architecture is the architecture containing the set of instructions each of which handles multiple data in parallel located in a SIMD register considered as a vector. There are great deal of research about utilizing SIMD instruction set on various operation in databases. In particular, join which is one of the important operation in relation database needs to improve performance for fast operation. Generally, hash join and sort merge join are used for join operation frequently. In this paper, we propose a sort merge join using SIMD instruction set for data-parallel operation and minimizing performance degradation caused by branch prediction miss on CPU, and we improve join performance by extending our SIMD algorithm to multiple thread structure. Also, our experimental results conducted in various environments show the efficiency of our SIMD algorithm. |
Å°¿öµå(Keyword) |
Á¶ÀÎ
SIMD
´ÙÁß ½º·¹µå
Á¤·ÄÇÕº´Á¶ÀÎ
Join
SIMD
multi-thread
Sort Merge Join
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|