Data Structures (B-Trees) Behind Databases and the External Memory
🎁 FREE Algorithms Interview Questions Course - https://bit.ly/3s37wON
🎁 FREE Machine Learning Course - https://bit.ly/3oY4aLi
🎁 FREE Python Programming Course - https://bit.ly/3JJMHOD
📱 FREE Algorithms Visualization App - http://bit.ly/algorhyme-app
In this lecture we are going to consider the concepts and data structures behind databases and the external memory.
We need totally different approaches than with internal memory. Why? Because we have to take access time into consideration. It is way slower to access an item present on the external memory. This is why we can not apply the same approaches as we have seen with standard data structures (such as arrays, linked lists ...).
We will come to the conclusion that B-trees are the best data structures for organizing data on the external memory. And this is exactly why databases rely heavily on B-trees as well.
🫂 Facebook: / globalsoftwarealgorithms
🫂 Instagram: / global.software.algorithms