(±¸)Á¤º¸°úÇÐȸ ³í¹®Áö
Current Result Document : 4 / 4
ÇѱÛÁ¦¸ñ(Korean Title) |
°ø°£ µ¥ÀÌŸº£À̽º ½Ã½ºÅÛ¿¡¼ ÃÖ´ëÈµÈ ³»ºÎ »ç°¢ÇüÀ» ÀÌ¿ëÇÑ °ø°£ »öÀÎ ±â¹ý |
¿µ¹®Á¦¸ñ(English Title) |
A Spatial Indexing Method with Maximial Internal Rectangle in Spatial Database Systems |
ÀúÀÚ(Author) |
±èÀçÈ«
¹èÇØ¿µ
Jae-Hong Kim
Hae-Young Bae
|
¿ø¹®¼ö·Ïó(Citation) |
VOL 22 NO. 04 PP. 0504 ~ 0513 (1995. 04) |
Çѱ۳»¿ë (Korean Abstract) |
°ø°£ µ¥ÀÌŸº£À̽º ½Ã½ºÅÛÀº °ø°£ °´Ã¼¿¡ ´ëÇÑ ºü¸¥ °Ë»öÀ» Áö¿øÇϱâ À§Çؼ °ø°£ »öÀÎÀÌ ¹Ýµå½Ã Áö¿øµÇ¾î¾ß ÇÑ´Ù. º» ³í¹®Àº ±âÁ¸ÀÇ °ø°£ »öÀÎ ±â¹ýµéÀÇ Á¾·ù¿Í Ư¼ºÀ» »ìÆ캻 ÈÄ, À̵éÀÇ ¹®Á¦Á¡ÀÎ º¯È¯(transformation), °ãħ ¿µ¿ª(overlapping region), À߸²(clipping)À» °í·ÁÇÏ¿© »õ·Î¿î °ø°£ »öÀÎ ±â¹ýÀÎ Rr-tree¸¦ Á¦¾ÈÇÏ°í ¼º´ÉÀ» ºñ±³ÇÑ´Ù. Rr-tree´Â ´Ù°¢ÇüÀÇ °ø°£ °´Ã¼¸¦ È¿À²ÀûÀ¸·Î °Ë»öÇÏ°í ó¸®ÇÒ ¼ö ÀÖµµ·Ï R-tree¸¦ È®ÀåÇÑ °ÍÀ¸·Î °ø°£ °´Ã¼³»¿¡ ÃÖ´ëÈµÈ ³»ºÎ »ç°¢Çü(Maximial Internal Rectangle : MIR)À» ÀÙ³ëµå¿¡ Ãß°¡ÇÏ¿© °ø°£ ÁúÀÇ¿¡ ´ëÇÑ ºü¸¥ °Ë»öÀ» Áö¿øÇÑ´Ù.
|
¿µ¹®³»¿ë (English Abstract) |
Spatial Indexing should be used to retrieve spatial objects rapidly in spatial database systems. In this paper, we survey the characteristics of existing spatial indexing methods, and we propose a new spatial indexing method called Rr-tree for enhanced transformation, overlapping region and clipping problems, and compare its efficiency with that of others Rr-tree is the extended R-tree to retrieve and handle spatial objects of polygon efficiently. As MIR(Maximized Internal Rectangle) is inserted in spatial object. Rr-tree can support rapid retrieval for spatial queries.
|
Å°¿öµå(Keyword) |
|
ÆÄÀÏ÷ºÎ |
PDF ´Ù¿î·Îµå
|