CST 363 - Week 5
An index on a database is supposed to speed up the process of a query. There are instances where using an index can do the opposite of this intended feature. An index is performed in three steps. The tree traversal, following the leaf node chain, and retrieving the data in the table. If blocks (the leaf nodes and the table data) are made too big then every time the index is performed, it will have to research through the entire block making the query take much longer to find the same information.
Comments
Post a Comment