Learning Journal Week 5
What the author means by slow indexes is that indexes are supposed to speed up look ups on a data table. However, there are aspects of indexes that can slow down searches. For example if we're looking for several different cells that match the value we're looking for, the index has to traverse the tree to get to our first match, but but then has to follow the chain of nodes to capture all the matches. This can take pretty long if there are many table rows that match our search value. Also, the accessing of the table itself can increase the time it takes to search for a value as well.
It seems consistent with our text's and how it recommends approaches to database design that avoid redundancy. The more unique our value, the faster it is to find all instances of it.
Comments
Post a Comment