I have been getting into the gRPC world for quite a while. It’s been on my radar for a long time ever since I got myself into Protobuf, but I never got the chance to use it until last year (If you are unfamiliar with protocol buffer, I wrote an introductory blog a few years ago about it).

Continuing with our last database index blog, in this part 2, we will briefly look at how B+ tree is used in the actual database system to indexing data, also we will take a brief comparison of the difference between the relational database and no-sql database. The widely used MySQL will be used as an example throughout this blog.

Many of us work with databases occasionally or daily. And I bet all of us are being told that to speed up the query speed, we can create and use index for tables. But probably few of us know how index is actually implemented under the hood, myself included. So I started developing an interest in this topic a while ago and wanted to know, at least at a high level, what makes database indexing happens.

Continuing the JVM blog series, this is part 3 of a JVM adventure. This post doesn't require you have the knowledge covered in my previous blogs Part 1 and Part 2, however, I still highly suggest you read them so that you will have a better understanding of materials covered here.