Àüü
ÀüÀÚ/Àü±â
Åë½Å
ÄÄÇ»ÅÍ
·Î±×ÀÎ
ȸ¿ø°¡ÀÔ
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....
¿¬±¸¹®Çå
±¹³» ³í¹®Áö
¿µ¹® ³í¹®Áö
±¹³» ÇÐȸÁö
Çмú´ëȸ ÇÁ·Î½Ãµù
±¹³» ÇÐÀ§ ³í¹®
³í¹®Á¤º¸
¹é¼
±¹³» ÇÐȸÁö
Ȩ > ¿¬±¸¹®Çå > ±¹³» ÇÐȸÁö >
µ¥ÀÌÅͺ£À̽º ¿¬±¸È¸Áö(SIGDB)
µ¥ÀÌÅͺ£À̽º ¿¬±¸È¸Áö(SIGDB)
Current Result Document :
6
/ 6
ÀÌÀü°Ç
ÇѱÛÁ¦¸ñ(Korean Title)
P2P ȯ°æ¿¡¼ »ï°¢ºÐÇÒÀ» ÀÌ¿ëÇÑ À̵¿³ëµåÀÇ À§Ä¡Á¤º¸°ü¸® ¹× ÁúÀÇó¸®
¿µ¹®Á¦¸ñ(English Title)
Management and Query Processing for Moving Objects by TIN in P2P
ÀúÀÚ(Author)
±Ç¿ÀÁ¦
¹®Á¤¿í
À̱âÁØ
¿ø¹®¼ö·Ïó(Citation)
VOL 21 NO. 01 PP. 0057 ~ 0072 (2005. 04)
Çѱ۳»¿ë
(Korean Abstract)
P2P ¸ðµ¨Àº ´ë·®À¸·Î ºÐ»êµÈ ȯ°æÀ» °ü¸®Çϴµ¥ ÀûÇÕÇÏ´Ù. ±âÁ¸ÀÇ ¼¹ö-Ŭ¶óÀ̾ðÆ® ¸ðµ¨°ú´Â ´Þ¸® P 2 P ¸ðµ¨Àº ¼¹ö°¡ Á¸ÀçÇÏÁö ¾Ê´Â´Ù. P2P¿¡¼ °¢ ³ëµå´Â ÀÚ½ÅÀÇ Á¤º¸¸¦ °øÀ¯ÇÏ°í ¿øÇÏ´Â Á¤º¸¸¦ °¡Áø ³ëµå¿Í Åë½ÅÇÑ´Ù. ÇÏÁö¸¸ ±âÁ¸ÀÇ P2P ¹æ¹ýµéÀº °ø°£Á¤º¸¸¦ ´Ù·ç°í ÀÖÁö ¾Ê±â ¶§¹®¿¡ º» ³í¹®¿¡¼ ÃÊÁ¡À» ¸ÂÃß°í ÀÖ´Â °ø°£ÁúÀǸ¦ ó¸®ÇÏÁö ¸øÇÑ´Ù. P2P ȯ°æ¿¡¼ µé·Î´Ï »ï°¢ºÐÇÒ ¹æ¹ýÀ» ÀÌ¿ëÇÑ ¶ó¿ìÆà ¹× °ø°£ÁúÀÇó¸® ¹æ¹ýÀÌ Á¦¾ÈµÇ¾úÀ¸³ª °íÁ¤³ëµå¸¸ ´Ù·ç°í Àֱ⠶§¹®¿¡ À̵¿³ëµå¿¡ Àû¿ëÇϴµ¥ ¹®Á¦Á¡ÀÌ ÀÖ´Ù. ÀÌ´Â µé·Î´Ï »ï°¢ºÐÇÒ ¹æ¹ýÀÇ Á¦¾àÁ¶°ÇÀÌ °Çؼ À̵¿³ëµåÀÇ À§Ä¡Á¤º¸¸¦ °»½ÅÇϴµ¥ Å« ºñ¿ëÀÌ µé±â ¶§¹®ÀÌ´Ù. µû¶ó¼ º» ³í¹®¿¡¼´Â µé·Î´Ï »ï°¢ºÐÇÒ¹æ¹ý¿¡ ºñÇØ Á¦¾àÁ¶°ÇÀÌ ¾àÇÑ ÀÏ¹Ý »ï°¢ºÐÇÒ¹æ¹ý(TIN)À» ÀÌ¿ëÇÏ¿© À̵¿³ëµåÀÇ À§Ä¡Á¤º¸¸¦ °»½ÅÇÏ°í °ø°£ÁúÀǸ¦ ó¸®Çϱâ À§ÇÑ ¹æ¹ýÀ» Á¦¾ÈÇÏ°íÀÚ ÇÑ´Ù.
¿µ¹®³»¿ë
(English Abstract)
P2P is a method to manage the massively distributed environments. Differently original serverclient model, P2P does not have a server. Each peer shares its information and communicates each others. But original researches in P2P only deal with exact matching search and attribute search and they are improperto spatial queries. There is a research which proposes routing and query processing algorithm using delauny triangulation in P2P. But this research only handles stationary nodes. So it cannot be applied to moving nodes. The reason is that constraints of delauny triangulation are so strict that there is a high cost to handle mobility. So in this paper, we use TIN, which has less constraints than delauny triangulation, and propose algorithm to manage the positioning information and process spatial queries about moving objects by TIN.
Å°¿öµå(Keyword)
P2P
À̵¿³ëµå
»ï°¢ºÐÇÒ¹æ¹ý
Moving Objects
TIN
ÆÄÀÏ÷ºÎ
PDF ´Ù¿î·Îµå
¸ñ·Ï
Copyright(c)
Computer Science Engineering Research Information Center
. All rights reserved.