Primary Indexing in Databases

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 is a data structure technique that is used to quickly locate and access the data in a database.

Types of Indexing :
There are two ways as following below.

1. Single-level Indexing –

  1. Primary indexing
  2. Clustering Indexing
  3. Secondary Indexing

2. Multilevel Indexing –

  1. B Trees
  2. B+ Trees

Primary indexing is defined mainly on the primary key of the data-file, in which the data-file is already ordered based on the primary key.

Primary Index is an ordered file whose records are of fixed length with two fields. The first field of the index replicates the primary key of the data file in an ordered manner, and the second field of the ordered file contains a pointer that points to the data-block where a record containing the key is available.

The first record of each block is called the Anchor record or Block anchor. There exists a record in the primary index file for every block of the data-file.

The average number of blocks using the Primary Index is = log2B + 1, where B is the number of index blocks.

Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up

Check out this Author's contributed articles.

If you like GeeksforGeeks and would like to contribute, you can also write an article using or mail your article to See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.

Article Tags :
Practice Tags :

Be the First to upvote.

Please write to us at to report any issue with the above content.