When are indexes disadvantageous?
The more variety you have in a column’s values, the more advantage you will get from creating an index on it.
Indexes are great for retrieving data. But having an index slows down INSERTS, UPDATES and DELETES, because each time you do one of these operations, your index has to be updated as well. So there might be cases where inserting records happens constantly, and retrieving these rows occurs only sporadically
The more variety you have in a column’s values, the more advantage you will get from creating an index on it.
Indexes are great for retrieving data. But having an index slows down INSERTS, UPDATES and DELETES, because each time you do one of these operations, your index has to be updated as well. So there might be cases where inserting records happens constantly, and retrieving these rows occurs only sporadically
What’s a B+Tree Index
A B+Tree is very similar to a standard B-Tree, except that the leaves are linked to each other with a pointer.
This is simply done to navigate through the leaves within a certain node quickly.
Read full article from A Simple Explanation on How B-Tree Database Indexes Work | Kyle's Cousin
No comments:
Post a Comment