Tuesday, July 7, 2020

Indexing Using B-Tree in DBMS

Indexing Using B-Tree


The B-tree structure was discovered by Rudolf Baer and Edward Mccwright (1970), one of the most popular techniques for organizing an indexed structure known as the equilibrium sort B-tree using external sorting. Is useful.
B-Tree has strong uses in the database system described by D. Comer in 1979.
“While no scheme can be adapted to the technique of organizing any file and its index database system called B-Tree is the standard organization for indexing.
A file is a collection of records. The index is uniquely associated with each record, an application of B-Tree found in IBM's Virtual Storage Access Method file organization.

Indexing Using B-Tree in DBMS

Many data manipulation functions. Data storage is required only in the main memory.
For applications for large DBs running on a system with the company, the data must be stored as another memory.

Advantages of Indexing Using B-Tree

  • 1) It is good for dynamic tables. Those tasks with multiple inserts, update, delete activity.
  • 2) It is good at supporting 24-hour operations.
  • 3) As the data is obtained through the index, it is always presented in order.
  • 4) B-tree indexes are good for various large tables because they require minimal restructuring.

Disadvantages of Indexing Using B-Tree

  • 1) For a static table, are better organized. This requires less input/output.
  • 2) IASN indexes are better for B-trees, not really suitable for individual small tables because index lookup becomes an important part of overall access time.
  • Because the indexes themselves are subject to significant. Which may be concurrent.


Note : If you like Indexing Using B-Tree in DBMS post, then tell us with the help of comment and share it with your friends, if any question is arising in your mind, then tell us through comment, we will reply to it soon.

No comments:

Post a Comment