Scribd
Upload
5 views1 page

Index

The document discusses different types of database indexes, including B-tree indexes for columns with a wide range of unique values, bitmap indexes for columns with very few distinct values, and function-based indexes that allow indexing on the result of a function applied to a column. B-tree indexes are suitable for unique identifiers like student or employee numbers, while bitmap indexes are ideal for columns with limited distinct values, such as department or gender. Function-based indexes enable efficient querying when functions are used in WHERE conditions, ensuring the index is utilized during execution.

Uploaded by

akshay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
5 views1 page

Index

The document discusses different types of database indexes, including B-tree indexes for columns with a wide range of unique values, bitmap indexes for columns with very few distinct values, and function-based indexes that allow indexing on the result of a function applied to a column. B-tree indexes are suitable for unique identifiers like student or employee numbers, while bitmap indexes are ideal for columns with limited distinct values, such as department or gender. Function-based indexes enable efficient querying when functions are used in WHERE conditions, ensuring the index is utilized during execution.

Uploaded by

akshay
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 1

btree index on a column where that data is distributed equally not very equally

it's it's completely distributed for example a column which have like wide range of
informations like a student register number or an employee roll number so such a
column because those columns will not have any duplicate are sometimes the columns
will have very very less duplicate tha

bitmap index typically will create on a column or it is recommended to create on a


column which has veryvery less number of distinct value so in this case we are
creating on Department because this particular column will have only three distinct
value like 10 20 and 30 so these bitmap columns are recommended for a column where
the number of distinct values are very very less such as like a grade column which
will have either pass or fail a gender column which you have either a male or a
female status column which will have yes or no so these kind of columns only
typically will create the bitmap index so the next.

function based index suppose if I create an index on an employee name column


because I feel that I'm using this column very frequently in my where condition so
I want to create a index on employee member name column but the once you created an
index on any column and if you use a function on top of that column then Oracle
will not use the index so instead what we can say when creating the index itself we
can view that particular function so you can see
the rest of the syntax are similar the only difference is we are using a function
as part of the index creation statement that is as part of the column
here so once we define this the indexed data will be stored along with the function
converted value okay so that this way this is called function based
index so once you have created a function based index so whenever you use this
particular function like whenever you say select star from this employ D
where a pair of a name equal to some name then this particular index will be used
as part of the execution okay so this is the function based index the

You might also like