Á¤º¸°úÇÐȸ ³í¹®Áö D : µ¥ÀÌŸº£À̽º
Current Result Document : 45 / 45
ÇѱÛÁ¦¸ñ(Korean Title) |
¼±Åà ÇÁ·¹µðÅ°Æ®¸¦ Æ÷ÇÔÇÏ´Â ½Ã°£ Áý°èÀÇ È¿À²Àû ó¸® |
¿µ¹®Á¦¸ñ(English Title) |
Efficient Processing of Temporal Aggregation including Selection Predicates |
ÀúÀÚ(Author) |
°¼ºÅ¹
Á¤¿¬µ·
±è¸íÈ£
Sung Tak Kang
Yon Dohn Chung
Myoung Ho Kim
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 35 NO. 03 PP. 0218 ~ 0230 (2008. 06) |
Çѱ۳»¿ë (Korean Abstract) |
½Ã°£Áö¿ø µ¥ÀÌŸº£À̽º ½Ã½ºÅÛ¿¡¼ÀÇ ½Ã°£ Áý°è ¿¬»êÀº ÀϹÝÀûÀÎ Áý°è ¿¬»êÀÇ È®ÀåÀ¸·Î½á, Áý°èÀÇ ¹üÀ§ Á¶°Ç¿¡ ¡®½Ã°£¡¯À» Æ÷ÇÔÇÑ´Ù. ½Ã°£ Áý°è ¿¬»êÀº ÀÌ·Â µ¥ÀÌŸ ¿þ¾îÇϿ콺, ÀüÈ ±â·Ï °ü¸®(CDR) µî¿¡ À¯¿ëÇÏ´Ù. º» ³í¹®¿¡¼´Â ÁúÀÇ Á¶°Ç¿¡ ¿©·¯ °³ÀÇ ¼±Åà ÇÁ·¹µðÅ°Æ®µéÀ» Æ÷ÇÔÇÏ´Â ½Ã°£ Áý°è ¿¬»êÀ» È¿À²ÀûÀ¸·Î ó¸®Çϱâ À§ÇÑ ÀÚ·á ±¸Á¶ÀÎ ITA-tree¸¦ Á¦¾ÈÇÏ°í, À̸¦ ÀÌ¿ëÇÑ ½Ã°£ Áý°è ó¸® ±â¹ýÀ» Á¦¾ÈÇÑ´Ù. ITA-tree¿¡¼´Â ·¹ÄÚµåÀÇ ½Ã°£ ±¸°£À» T-value¶ó´Â ÇϳªÀÇ °ªÀ¸·Î º¯È¯ÇÑ ÈÄ, B+-tree¿Í ºñ½ÁÇÏ°Ô ÀÌ °ªÀ» ÀÌ¿ëÇÏ¿© »öÀÎÀ» »ý¼ºÇÑ´Ù. ¶ÇÇÑ, ¸¹Àº ·¹Äڵ尡 µ¿ÀÏÇÑ T-value °ªÀ» °¡Áö°Ô µÇ´Â ÇÖ-½ºÆÌ ¹®Á¦¸¦ À§ÇØ °³¼±µÈ ITA-treeÀÎ eITA-tree¸¦ Á¦¾ÈÇÑ´Ù. º» ³í¹®¿¡¼´Â Á¦¾ÈµÈ ±â¹ýµéÀÇ ¼º´ÉÀ» ºÐ¼®°ú ½ÇÇèÀ» ÅëÇØ ºñ±³ÇÑ´Ù. |
¿µ¹®³»¿ë (English Abstract) |
The temporal aggregate in temporal databases is an extension of the conventional aggregate to include the time on the range condition of aggregation. It is a useful operation for Historical Data Warehouses, Call Data Records, and so on. In this paper, we propose a structure for the temporal aggregation with multiple selection predicates, called the ITA-tree, and an aggregate processing method based on the structure. In the ITA-tree, we transform the time interval of a record into a single value, called the T-value. Then, we index records according to their T-values like a B -tree style. For possible hot-spot situations, we also propose an improvement of the ITA-tree, called the eITA-tree. Through analyses and experiments, we evaluate the performance of the proposed method. |
Å°¿öµå(Keyword) |
½Ã°£Áö¿ø µ¥ÀÌŸº£À̽º
½Ã°£ Áý°è ¿¬»ê
µ¥ÀÌŸº£À̽º
temporal database
temporal aggregation
database
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|