Àüü
ÀüÀÚ/Àü±â
Åë½Å
ÄÄÇ»ÅÍ
·Î±×ÀÎ
ȸ¿ø°¡ÀÔ
About Us
ÀÌ¿ë¾È³»
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
Æ÷Ä¿½ºiN
¿¬±¸ÀÚ Á¤º¸
¶óÀÌ¡½ºÅ¸
ÆÄ¿öiNÅͺä
¼¼ÁßÇÑ
¿¬±¸ÀÚ·á
¹®ÀÚ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñÁ¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
´Ý±â
»çÀÌÆ®¸Ê
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±³À°Á¤º¸
¿¬±¸ ù°ÉÀ½
ÇаúÁ¤º¸
°ÀÇÁ¤º¸
µ¿¿µ»óÁ¤º¸
E-Learning
¿Â¶óÀÎ Àú³Î
½ÉÈÁ¤º¸
¿¬±¸ ¹× ±â¼úµ¿Çâ
Áֿ俬±¸ÅäÇÈ
ÁÖ¿ä°úÁ¦ ¹× ±â°ü
Çؿܱâ°ü °ü·ÃÀÚ·á
¹ÙÀÌ¿À Á¤º¸±â¼ú
ÁÖ¿ä Archive Site
ÄÄÇ»ÅÍiN
¿¬±¸ÀÚ Á¤º¸
¿¬±¸ÀÚ·á
¹®ÀÚ DB
Ȧ·Î±×·¥ DB
¿ë¾î»çÀü
¾Ë¸²¸¶´ç
ºÎ½Ç ÇмúÈ°µ¿ ¿¹¹æ
³í¹®¸ðÁý
´ëȸ¾È³»
What's New
¿¬±¸ºñ Á¤º¸
±¸ÀÎÁ¤º¸
°øÁö»çÇ×
IT Daily
CSERIC ±¤Àå
Post-Conference
¿¬±¸ÀÚ Ä«Æä
ÀÚÀ¯°Ô½ÃÆÇ
Q&A
¼ºñ½º ¹Ù·Î°¡±â
¼³¹®Á¶»ç
¿¬±¸À±¸®
°ü·Ã±â°ü
Please wait....
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±¹³» ³í¹®Áö
Ȩ > ¿¬±¸¹®Çå > ±¹³» ³í¹®Áö >
Çѱ¹Á¤º¸°úÇÐȸ ³í¹®Áö
>
Á¤º¸°úÇÐȸ ³í¹®Áö D : µ¥ÀÌŸº£À̽º
Á¤º¸°úÇÐȸ ³í¹®Áö D : µ¥ÀÌŸº£À̽º
Current Result Document :
7
/ 7
ÀÌÀü°Ç
ÇѱÛÁ¦¸ñ(Korean Title)
Top-n ½ºÄ«À̶óÀÎ ÁúÀÇ Ã³¸®¸¦ À§ÇÑ È¿À²ÀûÀÎ ±â¹ý
¿µ¹®Á¦¸ñ(English Title)
An Efficient Method for Processing Top-n Skyline Queries
ÀúÀÚ(Author)
Æ÷¹Ì¹Ì
Àå¼ö¹Î
À¯Àç¼ö
Weiwei BAO
Sumin Jang
Jaesoo Yoo
¿ø¹®¼ö·Ïó(Citation)
VOL 38 NO. 02 PP. 0126 ~ 0131 (2011. 04)
Çѱ۳»¿ë
(Korean Abstract)
Top-n ½ºÄ«À̶óÀÎ ÁúÀÇ´Â ´ÙÂ÷¿ø µ¥ÀÌÅÍ Áß¿¡ »ç¿ëÀÚÀÇ ¼±È£µµ¿¡ µû¶ó ½ºÄ«À̶óÀÎÀ» ±¸ÇÏ°í ±× ½ºÄ«À̶óÀÎ Áß¿¡¼ º¸´Ù Àǹ̰¡ ÀÖ´Â n °³ÀÇ µ¥ÀÌÅ͸¦ ¿ä±¸ÇÏ´Â ÁúÀÇÀÌ´Ù. Top-n ½ºÄ«À̶óÀÎ ÁúÀÇ¿¡ °ü·ÃµÈ ¿¬±¸ Áß¿¡ ´ëÇ¥ÀûÀÎ ¹æ¹ýÀº k-dominant ½ºÄ«À̶óÀÎÀÌ´Ù. k-dominant ½ºÄ«À̶óÀÎÀº k °³ÀÇ Â÷¿ø ¿¡¼ ´Ù¸¥ ¾î¶² µ¥ÀÌÅÍ¿¡ ÀÇÇØ Áö¹èµÇÁö ¾Ê´Â µ¥ÀÌÅ͸¦ ÀǹÌÇÑ´Ù. À̶§ k °ªÀÌ ÀÛÀ»¼ö·Ï º¸´Ù Àǹ̰¡ ÀÖ ´Â µ¥ÀÌÅÍÀÌ´Ù. ±×·¯³ª k-dominant ½ºÄ«À̶óÀÎÀ» ÀÌ¿ëÇÑ top-n ½ºÄ«À̶óÀÎ ÁúÀÇ Ã³¸®´Â k °ªÀ» 1ºÎÅÍ Áõ °¡½ÃÅ°¸é¼ ¿øÇÏ´Â n °³¸¦ ±¸ÇÒ ¶§±îÁö k-dominant ½ºÄ«À̶óÀεéÀ» ¹Ýº¹À¸·Î ±¸ÇØ¾ß ÇÑ´Ù. µû¶ó¼ ±âÁ¸ top-n ½ºÄ«À̶óÀÎ ÁúÀÇ Ã³¸®±â¹ýÀº È¿À²¼ºÀÌ ÁÁÁö ¾Ê´Ù. º» ³í¹®¿¡¼´Â ºÎºÐÂ÷¿øµé¿¡ ÇØ´çÇÏ´Â ½ºÄ«À̶ó Àεé°ú k-dominant ½ºÄ«À̶óÀÎµé °£¿¡ ³ªÅ¸³ª´Â Ư¼ºÀ» ÀÌ¿ëÇÑ ´ÙÂ÷¿ø µ¥ÀÌÅÍ¿¡¼ top-n ½ºÄ«À̶óÀÎ ÁúÀǸ¦ È¿À²ÀûÀ¸·Î ó¸®ÇÏ´Â »õ·Î¿î ±â¹ýÀ» Á¦¾ÈÇÑ´Ù. ´Ù¾çÇÑ ¼º´É Æò°¡¸¦ ÅëÇÏ¿© Á¦¾ÈÇÏ´Â ±â¹ýÀÇ ¿ì¼ö¼ºÀ» º¸¿©ÁØ´Ù.
¿µ¹®³»¿ë
(English Abstract)
The top-n skyline query is to find more interesting n points among skyline results retrieved according to user preference in multiple attributes data. The k-dominant skyline method is a representative one of the top-n skyline query processing methods. The k-dominant skyline includes points that are not dominated by any other points in terms of any k attributes. As the value k is smaller, the k-dominant skyline represents more important and meaningful data. However, the existing top-n skyline query processing method should repeatedly retrieve k-dominant skylines as the value k increases from 1 through n points. Therefore, the existing method is very inefficient. In this paper, we propose a new method that efficiently processes top-n skyline queries using the special relation of the sub-dimensional skyline and the k-dominant skyline. An extensive performance study verifies the merits of our proposed method.
Å°¿öµå(Keyword)
Top-n ½ºÄ«À̶óÀÎ
k-dominant ½ºÄ«À̶óÀÎ
´ÙÁß ¼Ó¼º µ¥ÀÌÅÍ
Top-n skyline
k-dominant skyline
multiple attributes data
ÆÄÀÏ÷ºÎ
PDF ´Ù¿î·Îµå
¸ñ·Ï
Copyright(c)
Computer Science Engineering Research Information Center
. All rights reserved.