Á¤º¸°úÇÐȸ ³í¹®Áö D : µ¥ÀÌŸº£À̽º
ÇѱÛÁ¦¸ñ(Korean Title) |
´ÙÁß ¿¬¼ÓÁúÀÇ¿¡¼ ½½¶óÀ̵ù À©µµ¿ì Áý°èÁúÀÇ ÃÖÀûȸ¦ À§ÇÑ |
¿µ¹®Á¦¸ñ(English Title) |
Linear Resource Sharing Method for Query Optimization of |
ÀúÀÚ(Author) |
¹é¼ºÇÏ
À¯º´¼·
Á¶¼÷°æ
¹èÇØ¿µ
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 33 NO. 06 PP. 0563 ~ 0577 (2006. 11) |
Çѱ۳»¿ë (Korean Abstract) |
½ºÆ®¸² 󸮱â´Â ´Ù¼öÀÇ ¿¬¼ÓÁúÀÇ¿¡¼ Á¦ÇÑµÈ ÀÚ¿øÀ» È¿À²ÀûÀ¸·Î ÀÌ¿ëÇϱâ À§ÇÏ¿© ÀÚ¿ø°øÀ¯ ±â¹ýÀ» ÀÌ¿ëÇÑ´Ù. ±âÁ¸ÀÇ ±â¹ýÀº °èÃþ±¸Á¶¸¦ À¯ÁöÇÏ¿© Áý°èÁúÀǸ¦ ó¸®ÇÑ´Ù. ±×·¡¼ »ðÀÔ¿¬»êÀº °èÃþ±¸Á¶ À籸¼º ºñ¿ëÀÌ ÇÊ¿äÇÏ´Ù. ¶ÇÇÑ °Ë»ö¿¬»êÀº ¼·Î ´Ù¸¥ ½½¶óÀ̵ù À©µµ¿ì Å©±â¿¡ ¼ÓÇÏ´Â Áý°èÁ¤º¸ °Ë»öºñ¿ëÀÌ ÇÊ¿äÇÏ´Ù. ±×·¡¼ º» ³í¹®¿¡¼´Â º¸´Ù ºü¸¥ ÁúÀÇ Ã³¸®¸¦ À§ÇØ ¼±Çü ÀڷᱸÁ¶¸¦ »ç¿ëÇÑ´Ù. Á¦¾È±â¹ýÀº ÆÒ(Pane)Å©±â °áÁ¤´Ü°è¿Í ÆÒ »ý¼º´Ü°è, ÆÒ »èÁ¦´Ü°è·Î ±¸¼ºµÈ´Ù. ÆÒ Å©±â °áÁ¤´Ü°è´Â Á¤È®ÇÑ Áý°èÁ¤º¸¸¦ À¯ÁöÇϱâ À§ÇÑ ÃÖÀû ÆÒ Å©±â¸¦ °áÁ¤ÇÏ´Â ´Ü°èÀ̸ç, ÆÒ »ý¼º´Ü°è´Â ½ºÆ®¸² ¹öÆ۷κÎÅÍ ÆÒ Å©±â¸¸ÅÀÇ µ¥ÀÌŸ¿¡ ´ëÇÑ Áý°èÁ¤º¸¸¦ ÀúÀåÇÏ´Â ´Ü°èÀÌ´Ù. ÆÒ »èÁ¦´Ü°è´Â ´õ ÀÌ»ó ¿¬¼ÓÁúÀÇ°¡ »ç¿ëÇÏÁö ¾Ê´Â ÆÒÀ» »èÁ¦ÇÏ´Â ´Ü°èÀÌ´Ù. Á¦¾È ±â¹ýÀº ¼±Çü ÀÚ·á ±¸Á¶¸¦ ÀÌ¿ëÇϹǷΠ°èÃþ±¸Á¶¸¦ ÀÌ¿ëÇÏ´Â ÀÚ·á ±¸Á¶¿¡ ºñÇØ ÀÚ¿øÀ» Àû°Ô »ç¿ëÇÑ´Ù. ¶ÇÇÑ ½ºÆ®¸² µ¥ÀÌŸ°¡ ÀԷµǾ ÆÒ Å©±â¿¡ ÇØ´çÇÏ´Â Áý°èÁ¤º¸¸¸ °è»êÇÏ¸é µÇ¹Ç·Î Áý°èÁ¤º¸ »ðÀÔºñ¿ëÀÌ °¨¼ÒÇÏ°í, ¼·Î ´Ù¸¥ ½½¶óÀ̵ù À©µµ¿ì Å©±â¿¡ ´ëÇؼµµ ¼±Çü°Ë»öÀ¸·Î Áý°èÁ¤º¸ °Ë»öºñ¿ëÀÌ °¨¼ÒÇÑ´Ù. ¼º´ÉÆò°¡¸¦ ÅëÇÏ¿© Á¦¾È±â¹ýÀÌ ÀûÀº ¸Þ¸ð¸® »ç¿ë °á°ú¸¦ º¸¿´À¸¸ç, ÁúÀÇ Ã³¸® ¼Óµµ°¡ Áõ°¡ÇÏ¿´´Ù. |
¿µ¹®³»¿ë (English Abstract) |
A stream processor uses resource sharing method for efficient of limited resource in multiple continuous queries. The previous methods process aggregate queries to consist the level structure. So insert operation needs to reconstruct cost of the level structure. Also a search operation needs to search cost of aggregation information in each size of sliding windows. Therefore this paper uses linear structure for optimization of sliding window aggregations. The method comprises of making decision, generation and deletion of panes in sequence. The decision phase determines optimum pane size for holding accurate aggregate information. The generation phase stores aggregate information of data per pane from stream buffer. At the deletion phase, panes are deleted that are no longer used. The proposed method uses resources less than the method where level structures were used as data structures as it uses linear data format. The input cost of aggregate information is saved by calculating only pane size of data though numerous stream data is arrived, and the search cost of aggregate information is also saved by linear searching though those sliding window size is different each other. In experiment, the proposed method has low usage of memory and the speed of query processing is increased. |
Å°¿öµå(Keyword) |
ÀÚ¿ø°øÀ¯
½ºÆ®¸²
½½¶óÀ̵ù À©µµ¿ì
Áý°è
ÁúÀÇ ÃÖÀûÈ
resource sharing
stream
sliding window
aggregate
query optimization
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|