CST 363 - Week 5

Indexing and Database Recording

This week we learned about the different data structures that databases use to optimize performance. MySQL and similar databases use a B+ Tree structure. These function like a red and black tree, with a starting branch at the midpoint of the data's primary keys. The branches then split up based on whether the child pointer is smaller or larger than the parent pointer. B+ trees can have a large number of child pointers. The more pointers each parent branch has, the faster a database can perform searches for a specific leaf node or value.

Our assignment was an example of indexing in a database. Indexing keeps track of primary keys and assigns each of them something like a secondary id to keep them in order. This allows the original database to store items in whatever order it likes while referencing the separate indexing table to find out the ordering of all of its entries. The main benefit of indexing is the ability to add or remove entries without completely recalculating your new table.

I was not able to see this in our assignment. I put about 20 hours into the second part of the assignment while making little to no progress.  Needless to say, I am not completely satisfied with how I did this week. But here's hoping to finishing the rest of the course strong.