[Previous page]
 
»ç¿ë¼³¸í¼­ 

ÀÌÇÁ·Î±×·¥Àº ÆÄÀÏ󸮷Р°úÁ¦¹° "B-Tree±¸Çö½ÇÇè"À»À§ÇØ ¸¸µé¾ú¾î.(ÂüÁ¶ : ±³Àç 212ÂÊ ÂüÁ¶ÇϽöó.) 
±¸ÇöµÈ ToolÀº ¾ÆÁÖÇâ±ßÇÏ°í ¸ÀÀÖ´Â ÀÎÅÍ·ºÆ¼ºêÇÑ ÀÚ¹Ù(JDK1.1.4)·Î ¸¸µé¾ú´Ù´Â »ç½Ç. 

  ±â´ÉÀÌ ¾ÆÁÖ¾ÆÁÖ °­·ÂÇØ¼­ ·£´ýÀ¸·Î ¹ß»ýµÈ ¼öÄ¡·Î Æ®¸®µµ ±¸¼ºÇÒ¼öµµÀÖ°í, °Ë»ö±â´ÉµµÀÖ°í, »èÁ¦±â´ÉµµÀÖ´Ù. 
¹°·Ð »ðÀÔ±â´ÉµµÀÖÁö.. ¸ð´ÏÅÍÀÇ Á¦¾à»ó 80°³ÀÇ Å°¿Í 40³ëµå±îÁöÀÇ 4°³°èÃþÀ¸·Î Á¦ÇÑÀ» µÎ¾ú¾î. ¸¸ÀÏ ³Ê°¡ 
±×ÀÌ»óÀ» Ãʰ¡ÇÏ¸é ¾î¶»°Ô µÇ°Ú´Ï?.. ¹°·Ð º¸ÀÌÁöµµ ¾Ê°Ú°í ÅØ½ºÆ®¹Ú½º¿¡ À߸øµÈ °ÍÀ̶ó°í ÇÏ´Â ¸Þ½ÃÁö¸¦ 
º¸°ÔµÉ°Å¾ß... 
(°Ë»öµÈŰ³ª »ðÀÔµÈŰ´Â »¡°£»öÀ¸·Î °­Á¶µÇ´Ï±î µÎ´«À» ¶ß°í ÀߺÁ) 
 

»ç¿ë¹ýÀ» Á¶±Ý¼³¸íÇÒ²² 
·£´ýÆ®¸®À̶ó´Â ¹öưº¸ÀÌÁö 
                            ·£´ýÀ¸·Î¹ß»ýµÈ ۰ªÀ¸·Î ¸¶±¸ ¸¸µé¾î´ë´Â Æ®¸®¸¦ ¸¸µé¾î³», ¶Ç´Ù½Ã À̹øÆ°À» 
                            Ŭ¸¯ÇÏ¸é ¶Ç»õ·Î¿î ·£´ýÆ®¸®¸¦ ¸¸µé¾î ³»Áö, Çѹø ÇØºÁ.. 

»ðÀÔÀ̶ó´Â ¹öưº¸ÀÌÁö 
                            ÅØ½ºÆ®¹Ú½º¿¡ ¸ÕÀú »ðÀÔÇÒ Å°°ªÀ» ÀÔ·ÂÇÏ°í »ðÀÔ¹öưÀ» ´©¸£¸é Æ®¸®°¡ ¸¸µé¾îÁö´Â 
                            °úÁ¤À» º¼¼ö ÀÖ¾î. ¸¸ÀÏ ÅØ½ºÆ®¹Ú½º¿¡ ¾Æ¹«°Íµµ ÀÔ·ÂÇÏÁö ¾Ê°í »ðÀÔ¹öưÀ» ´©¸£¸é 
                            ·£ÅÒ°ªÀ¸·Î »ý±ä ۰ª¿¡ÀÇÇØ Æ®¸®¸¦ ¸¸µé¾îÁöµµ·Ï ¸¸µé¾ú¾î. 

»èÁ¦¶ó´Â ¹öưº¸ÀÌÁö 
                            ¸ÕÀú ÅØ½ºÆ® ÇÊÆ®¿¡ »èÁ¦ÇÒ Å°°ªÀ» ÀÔ·ÂÇÏ°í ¹öưÀ» »ì¦Ŭ¸¯ÇÏ¸é »èÁ¦µÇ¸é¼­ ¾î¶»°Ô 
                            Æ®¸®±¸Á¶°¡ º¯°æµÇ´ÂÁö º¸°ÔµÉ°Å¾ß. ¾ø´Â ۰ªÀ» »èÁ¦ÇÏ·Á°í ÇÏ¸é ¾î¶»°Ô µÇ°Ú´Ï... 

°Ë»öÀ̶ó´Â ¹öưº¸ÀÌÁö 
                            ¸ÕÀú ÅØ½ºÆ® ÇÊÆ®¿¡ °Ë»öÇÒ Å°°ªÀ» ÀÔ·ÂÇÏ°í ¹öưÀ» »ì¦Ŭ¸¯ÇÏ¸é °Ë»öµÈ ۴ 
                            »¡°£»öÀ¸·Î °­Á¶µÇ¾î º¸À̰Եɰžߠ

±ú²ýÈ÷¶ó´Â ¹öưº¸ÀÌÁö       ¸ðµçÆ®¸®µéÀ» Áö¿ö¹ö·Á. 
 
 

ÀÚ·á´Â ¾ðÁ¦³ª ³ª´©´Â °ÍÀÌ Áß¿äÇÑ°Í ¾Æ´Ï´Ï(?) ±×·¡¼­ ÆÄ¶õ´«À» °®°íÀÖ´Â »ç¶÷µéÀÌ ³ªÀÇ È¨ÆäÀÌÁö¿¡ 
¿ÔÀ»¶§ ÂüÁ¶¸¦ ÇÒ¼öÀÖµµ·Ï ÄÚµùÀ» ¼ö°í½º·´°Ô Á» ÇØ³ù¾î 

[The following is the same message in ENGLISH for foreigner.

 This is a interactive JAVA demonstration of B tree, it allows you to either randomly create a B tree, 
insert a random key, insert or delete a user defined key, and also search for a user defined key. For each 
key successfully inserted, it will be highlighted as red, and each key found using the search will also be 
highlighed as red. 

Note: 
     Due to the limitation of the monitor, the size of the b tree is limited to 4 levels only, 
     and up to 40 nodes with 80 keys, and the value of the key is limited between 1 and 99. 
     If a tree created exceeds the 4th level, it will not show the nodes at level 5 and beyond and 
     it will tell you to clear the tree. 

      Random Tree Button: 
                      Click this will produce a random b tree up to 35 keys. Everytime Random Tree button 
                      is clicked, it will produce a new random b tree. 

      Insert Button: Inserts a key into the tree, if no key is entered in the text field then it will insert a 
                     random key. If the tree is initially empty, insert will create a new tree 

      Delete Button: Deletse a user defined key, make sure you enter the key in text field 

      text field: This allows you, the user to enter a key for either Insert, Delete or Search, the key valus 
                  is limited to between 1 and 99 

      Search Button: Search a user defined key, make sure you enter the key in text field 

      Clear Button: Clears the entire tree 

[Previous page]