CST 363 - Module 5

 Week 5,

This week had us practicing more with MySql, using what we already know to find very specific information across multiple tables. In addition, we also learned more about transaction management, such as using commits, rollbacks, and learning about concurrency, schedules and transactions themselves. This could be helpful when preserving information if something unexpected happened. Like someone trying to withdraw cash, but right as the atm is about to dispense the cash and already changed the user's bank information, the power shuts down. This would require measures so that the user's money is protected.

However, I have been asked about something intriguing I want to talk about. If indexes are supposed to speed up the performance of a query, then why can indexes be referred to as slow indexes? Markus Winand talks about this in his website "Use the Index Luke". In short, indexes are great for finding something in a large dataset. However, if there are duplicate values for what you are looking for in the leaf node chain at the end of the tree traversal, then you are performing both a tree traversal and following the leaf node chain. Additionally, with getting multiple "hits" you now have to perform a table access for each hit. Overall, it is something to think about for implementing indexes, though there are work-arounds. 

Comments

Popular posts from this blog

CST 300 - Module 4

CST 300 - Module 2

CST 300 - Module 3