Á¤º¸°úÇÐȸ ³í¹®Áö B : ¼ÒÇÁÆ®¿þ¾î ¹× ÀÀ¿ë
Current Result Document : 14 / 15
ÇѱÛÁ¦¸ñ(Korean Title) |
DEhBT : hB-tree¸¦ ÀÌ¿ëÇÑ ´ÙÂ÷¿ø µ¥ÀÌŸ ºÐÇÒ ±â¹ý |
¿µ¹®Á¦¸ñ(English Title) |
DEhBT: A Multidimensional Data Partitioning Scheme using hB-tree |
ÀúÀÚ(Author) |
±èµ¿¿¬
¿À¿µ¹è
ÃÖµ¿ÈÆ
ÇÑ»ó¿µ
ÀÌ»ó±¸
DongYoun Kim
Young-bae Oh
Dong-Hoon Choi
SangYong Han
Sang-goo Lee
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 26 NO. 01 PP. 0016 ~ 0024 (1999. 01) |
Çѱ۳»¿ë (Korean Abstract) |
º» ³í¹®¿¡¼´Â º´·Ä DBMS¸¦ »ç¿ëÇÏ´Â µ¥ÀÌŸ ¿þ¾îÇϿ콺ÀÇ ¼º´ÉÀ» °³¼±Çϱâ À§ÇÑ »õ·Î¿î ´ÙÂ÷¿ø µ¥ÀÌŸ ºÐÇÒ ±â¹ýÀ» Á¦¾ÈÇÑ´Ù. µ¥ÀÌŸ ¿þ¾îÇϿ콺´Â ¸¹Àº ¾çÀÇ µ¥ÀÌŸ¸¦ ÀúÀåÇÏ´Â ´ë¿ë·® µ¥ÀÌŸº£À̽ºÀÌ¸ç ºÐ¼®ÀûÀÎ Á¤º¸¸¦ ¾ò±â À§ÇÑ ´ÙÂ÷¿ø ¹üÀ§ ÁúÀÇ°¡ ´ëºÎºÐÀ» Â÷ÁöÇÑ´Ù. ´ÜÀÏ Â÷¿ø ºÐÇÒ ±â¹ýÀ¸·Î´Â ´ÙÂ÷¿ø ÁúÀǸ¦ È¿°úÀûÀ¸·Î ó¸®Çϱ⠾î·Æ°í ±âÁ¸ÀÇ ´ÙÂ÷¿ø ºÐÇÒ ±â¹ýÀº ÀÓÀÇÀÇ ¾Ë ¼ö ¾ø´Â ºÐÆ÷¸¦ °¡Áø µ¥ÀÌŸ¿¡ ´ëÇØ ±ÕµîÇÑ ºÐÇÒÀ» º¸ÀåÇϱ⠾î·Æ´Ù. º» ³í¹®¿¡¼´Â hB-tree ±¸Á¶¸¦ ÀÌ¿ëÇÏ¿© ±ÕµîÇÑ ºÐÇÒÀ» º¸ÀåÇÏ´Â ´ÙÂ÷¿ø ºÐÇÒ ±â¹ýÀ» Á¦¾ÈÇÏ°í ±× ¼º´ÉÀ» ÃøÁ¤Çϱâ À§ÇÑ ½Ã¹Ä·¹ÀÌ¼Ç °á°ú¸¦ º¸ÀδÙ. ½Ã¹Ä·¹À̼ǿ¡¼ hB-tree ºÐÇÒ ±â¹ýÀº ±Õµî ºÐÆ÷»Ó ¾Æ´Ï¶ó ºñ±Õµî ºÐÆ÷ µ¥ÀÌŸ ÁýÇÕ¿¡ ´ëÇؼµµ ±ÕµîÇÑ ºÐÇÒÀ» º¸ÀδÙ.
|
¿µ¹®³»¿ë (English Abstract) |
A new multidimensional data partitioning scheme for data warehouse application in multiprocessor environment is proposed in this paper. In data warehouse, large amount of data are stored, retrieved and processed. Most queries in data warehouse are multidimensional queries to get analytic informations. Single dimensional partition methods cannot process the multidimensional queries efficiently and many multidimensional partitioning techniques are not able to guarantee balanced partitioning about data sets with unknown data distribution. We introduce new multidimensional data partitioning scheme based on hB-tree which guarantees balanced declustering for any data set. Simulation results show that hB-tree partitioning scheme provides balanced declustering for the data set with nonuniform distribution as well as that with uniform distribution.
|
Å°¿öµå(Keyword) |
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|