Àüü
ÀüÀÚ/Àü±â
Åë½Å
ÄÄÇ»ÅÍ
·Î±×ÀÎ
ȸ¿ø°¡ÀÔ
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 :
2
/ 2
ÀÌÀü°Ç
ÇѱÛÁ¦¸ñ(Korean Title)
À¯Çü ¼Ó¼ºÀ» Æ÷ÇÔÇÏ´Â ¿¬¼Ó ¹üÀ§ ÁúÀÇ Ã³¸®
¿µ¹®Á¦¸ñ(English Title)
On Processing Continuous Range Queries with Type Attributes
ÀúÀÚ(Author)
±Ç¿µ¸ð
Á¤Çϸ²
±è¿ë¼º
Á¤¿¬µ·
YoungMo Kwon
HaRim Jung
YongSung Kim
YonDohn Chung
¿ø¹®¼ö·Ïó(Citation)
VOL 26 NO. 03 PP. 0003 ~ 0016 (2010. 12)
Çѱ۳»¿ë
(Korean Abstract)
º» ³í¹®Àº ´Ù¾çÇÑ À¯ÇüÀÇ À̵¿ °´Ã¼µé Áß ÁÖ¾îÁø ¹üÀ§ ³»¿¡ Á¸ÀçÇϴ ƯÁ¤ À¯ÇüÀÇ À̵¿ °´Ã¼µéÀ» Áö¼ÓÀûÀ¸·Î ã°í °ü¸® ÇÏ´Â À¯Çü ¼Ó¼ºÀ» Æ÷ÇÔÇÏ´Â ¿¬¼Ó ¹üÀ§ ÁúÀÇÀÇ È¿À²ÀûÀΠ󸮿¡ ´ëÇØ ³íÇÑ´Ù. ƯÈ÷, ¼¹ö Áß½ÉÀÇ ¿¬»ê ȯ°æ¿¡¼ ¹ß»ýÇÒ ¼ö ÀÖ´Â ¼¹öÀÇ º´¸ñÇö»ó ±Øº¹°ú ÁÖ±âÀûÀÎ À§Ä¡ º¸°í·Î ÀÎÇÑ À̵¿ °´Ã¼ÀÇ ¿¡³ÊÁö ¼Òºñ Àý°¨À» À§ÇØ À̵¿ °´Ã¼µéÀÇ ¿¬»ê ´É·ÂÀ» È°¿ëÇÑ ºÐ»êÈ µÈ ÁúÀÇ Ã³¸® Àü·«À» È°¿ëÇϱâ À§ÇØ °¢°¢ÀÇ À̵¿ °´Ã¼°¡ Á÷Á¢ ó¸®ÇØ¾ß ÇÏ´Â ÁúÀǸ¦ Æ÷ÇÔÇÏ´Â ¿µ¿ªÀÎ »óÁÖ ¿µ¿ª (resident domain) °³³äÀ» µµÀÔÇÑ´Ù. ¶ÇÇÑ, À¯Çü ¼Ó¼ºÀ» °í·ÁÇÑ »óÁÖ ¿µ¿ª °áÁ¤ ¹× ÇÒ´çÀ» À§ÇØ BP-tree (Binary Partitioning tree)ÀÇ È®Àå º¯ÇüÀÎ B2P-tree(Bit-vector Binary Partitioning tree)¸¦ Á¦¾ÈÇÏ°í B2P-tree Ž»ö ¾Ë°í¸®ÁòÀ» ¼Ò°³ÇÑ´Ù. ¼º´É Æò°¡¸¦ ÅëÇØ Á¦¾ÈÇÏ´Â B2P-tree¸¦ ÅëÇÑ »óÁÖ ¿µ¿ª °áÁ¤ ¹× ÇÒ´ç ±â¹ýÀÇ ¿ì¼öÇÔÀ» º¸ÀδÙ.
¿µ¹®³»¿ë
(English Abstract)
This paper addresses efficient processing of a continuous range query with type attributes, which continually monitors only the specific types of moving objects falling within a given query region. We follow a distributed continuous range query processing strategy with the notion of resident domain, where the server pushes some query processing tasks to the moving objects¡¯ side to achieve significant savings in terms of server load as well as communication costs. We propose a novel BP-tree (Binary Partitioning tree) variant index structure called the B2P-tree (Bit-vector Binary Partitioning tree) to facilitate determining the type attributed resident domain for each moving object. The search algorithm on the B2P-tree is also discussed. Through simulation experiments, we demonstrate the superiority of our B2P-tree based method for determination of the type attributed resident domain.
Å°¿öµå(Keyword)
¿¬¼Ó ¹üÀ§ ÁúÀÇ
»óÁÖ ¿µ¿ª
À¯Çü ¼Ó¼º
B2P-tree
Continuous range query
resident domain
type attributes
B2P-tree
ÆÄÀÏ÷ºÎ
PDF ´Ù¿î·Îµå
¸ñ·Ï
Copyright(c)
Computer Science Engineering Research Information Center
. All rights reserved.