Skip to content

Tag Archives: DBMS Indexing

Prerequisite – Indexing in Databases Indexing is a procedure that returns your requested data faster from the defined table. Without indexing, the SQL server has… Read More
An index is a schema object. It is used by the server to speed up the retrieval of rows by using a pointer. It can… Read More
Indexing is a way to optimize the performance of a database by minimizing the number of disk accesses required when a query is processed. It… Read More
It is recommended to refer following posts as prerequisite of this post.B-Tree | Set 1 (Introduction) B-Tree | Set 2 (Insert)B-Tree is a type of a… Read More
  In the previous post, we introduced B-Tree. We also discussed search() and traverse() functions. In this post, insert() operation is discussed. A new key is… Read More
B-Tree is a self-balancing search tree. In most of the other self-balancing search trees (like AVL and Red-Black Trees), it is assumed that everything is… Read More

Start Your Coding Journey Now!