Relational Databases and some non-relational databases use B+ trees to hold the data but why? One of the main reasons why SQL databases use B+ trees to hold the data is because of their efficiency in performing operations such as insert, update, find, and delete.
Hey Arpit, your videos are amazing. I am seeing them for quite sometime now and i have a request. Can you please based on your availability create some videos covering Geo-spatial indexes as well ? Since now a days, they are being used quite extensively and there are lots of approaches to implement those like quadtree, Hilbert curve etc., hence i believe it will be beneficial for everyone.
Hey Arpit, your videos are amazing. I am seeing them for quite sometime now and i have a request. Can you please based on your availability create some videos covering Geo-spatial indexes as well ? Since now a days, they are being used quite extensively and there are lots of approaches to implement those like quadtree, Hilbert curve etc., hence i believe it will be beneficial for everyone.
Thanks in advance