DENSE INDEXING TEGNEQUE

IN DBMS

Yaseen Rana – 040

Fatima Irfan – 046
What is indexing ?
Indexing is a way to optimize the performance of a database by minimizing the number of disk
accesses required when a query is processed
Indexing is a data structure technique which allows us to quickly retrieve records from a
database file.
An Index is a small table having only two columns. The first column contains a copy of the
primary or candidate key of a table and second column contains a set of pointers for holding
the address of the disk block where that specific key value is stored.
Types of indexing
 Primary index
 Dense index
 Sparse index
 Secondary index
 Clustering index
Indexing Tree
Dense Indexing Technique 1|2
In dense index, there is an index record for every search key value in the database. This makes
searching faster but requires more space to store index records itself. Index records contain
search key value and a pointer to the actual record on the disk.
Dense Indexing Technique 2|2

Figure 1.1

 For every search key value in the data file, there is an index record.
 This record contains the search key and also a reference to the first data record with that
search key value.
Advantages & Disadvantages
Advantages
 Speed up SELECT query
 Helps to make a row unique or without duplicates(primary, unique) 
 If index is set to fill-text index, then we can search against large string values. for example
to find a word from a sentence etc.
Disadvantages
 Indexes take additional disk space.
 Indexes will slow down INSERT, UPDATE and DELETE, but will speed up UPDATE if
the WHERE condition has an indexed field. INSERT, UPDATE and DELETE becomes
slower because on each operation the indexes must also be updated. 
End

Thank you…