Skip to main content

What Is B-tree

                                     B-tree

What is B-tree ? 
  • B-tree : A b-tree is a self-balancing Tree data Structure  . it maintains sorted data and allows searches , Sequential access , insertion and deletion in O( log n ) Time .




b tree,b-tree,btree,tree,b+ tree,b tree tutorial,b trees,binary tree,balanced tree,data structure,b tree index,b tree delete,b tree search,b tree example,b tree deletion,b tree of order 3,b tree insertion,deletion in b tree,b tree definition,b tree in database,trees,btree vs b+tree,in tree,insertion in b tree,how to create b tree,b+ trees,b tree index in oracle,b tree nptel reference

  • Properties Of B-tree : A B-tree of order M is a tree which satisfied the following properties 
                        1) Every Node At most M children
                        2) Every non-leaf node has at least ⌈M/2⌉Child nodes .
                        3) The root has at least two children if it is not a leaf node .
                        4) A non-leaf node with k children contains k-1 keys .
                        5) All leaves appear in the same level .
  • Time Complexity Of B-tree : Insertion , deletion and searching all operation are worst case time complexity is O(log n) .
  • Space Complexity Of B-tree : worst case is  O(n) .
  • Advantage Of B-tree :
                            1) Keeps keys in sorted order for sequential traversing .
                            2) uses a hirarchical index to minimize the number of disk read
                            3) uses partially full blocks to speed insertion and deletion .
                            4) keeps the index balanced with recursive algorithm .
             
Labels:

Comments

Post a Comment

Popular posts from this blog

important question on Entity Relationship Model(ER Model)

5)A university registrar’s office maintains data about the following entities: (a) courses, including number, title, credits, syllabus, and prerequisites; (b) course offerings, including course number, year, semester, section number, instructor(s), timings, and classroom; (c) students, including student-id, name, and program; and (d) instructors, including identification number, name, department, and title. Further, the enrollment of students in courses and grades awarded to students in each course they are enrolled for must be appropriately modeled. Construct an E-R diagram for the registrar’s office. Document all assumptions that you make about the mapping constraints. Answer:   In the answer given here, the main entity sets are student, course, course-offering, and instructor. The entity set course-offering is a weak entity set dependent on course. The assumptions made are : a class meets only at one particular place and time. This E - R diagram cannot model a class meet
Post a Comment
Read more

Library Management System DataFlow Diagram

Library Management System DataFlow Diagram 1) Zero Level DFD 2) 1st level DFD and 2nd level DFD
Post a Comment
Read more

how to Install Numpy, Pandas and matplotlib on ubuntu 18.04 and Linux Mint

Install Python, NumPy,Matplotlib for Python 3 on Ubuntu 18.04, Linux Mint, Debian Linux. This is a short article about installing Numpy, Pandas , Matplotlib, Python3 on the latest Ubuntu 18.04 LTS, Linux Mint, Debian Linux which comes with Python 3.6.5. Let’s start by making sure we have an updated system: 1 sudo apt update 2 sudo apt upgrade Now, let’s install NumPy, Pandas,Matplotlib : sudo apt-get install python-pip sudo pip install numpy sudo pip install pandas sudo pip install matplotlib Test numpy : Open up a Terminal in Your Linux Operating System by running the following: python3 At the Terminal, type the following: >>> import numpy as np >>> np.__version__ '1.13.3'   Test Pandas : Open up a Terminal in Your Linux Operating System by running the following: python3 At the Terminal, type the following: >>> import pandas as pd >>> pd.__version__ '0.22.0'   Test Matpl
2 comments
Read more