Analisis algoritma pencarian pada pohon-B

Abstract

Pohon Telusur m-Cabang banyak diterapkan dalam external storage unfair iiialiage dgitct &lam jib-4A. -yang besar. Karerta alum kusatitat-3 etiperinkaa wain formasi potion variasi lairmya yang dapat menampung data dalam jumlah besar dan memiliki ketinggian minimum sedemikian sehingga data dapat dioperasikan dengan lebih effisien dan effektif Kriteria ini dipenuhi oleh Pohon-B. Dalam togas akhir ini, dijelaskan dua wacana panting dalam pembahasan Pohon-B, yaitu metode split yang diguuakan dalam proses penyisipan den consolidation dalam penghaptuum beserta anaiisis keduanya. Multiway (m-way ) search trees are mostly used, especially to store and to manage data on external storage in large quantities. For this quantity reason, it is necessary to examine another variety of tree formation which is able to accomodate data in large quantities with minimum height such that data can be operated and accessed more efficiently and more effectively. These criteria are fulfilled by B-trees In this final project, two main problems ( which are most discussed ) will be explained in discussing B-trees, that is, split method which is used in insertion process and consolidation method in deletion process with both analyses.