The scenario: When a user updates some information - the correct row must be found and updated.
I'm debating between two options:
- Let the server search through all of the rows (-slow). But be fast on the update.
- Index, and therefore be fast to find, but slow to update.
It seems that if the index is a binary tree - updating will be quick and therefore indexing is better. And if not - not-indexing would be better because indexing will lose more when updating than gain when searching.
(Note that every user-action here will have both a search and an update.)
- I'm referring mainly to non-clustered indexing.
- Currently there are very few rows so it's difficult to assess the speed if and when there will be over 1-10 million rows.