Why this query is fast 

Am I missing something or is uniqueness a game breaker here? Since B is not a primary key we have no guarantee on the uniqueness and therefore we might have millions of records between 50 and 50000

I am continuing to Add to my portfolio. As warren Buffet said "be brave when everyone else is fearful ". The stock market ALWAYS recover, so hold for long term and have the stomach for the ride 👍.

Good stuff my guy. It’d be great to have some visuals with the type of discussions just to bring the point home. Anyway, I appreciate these videos a lot. Thanks Hussein! 😁

It's 'analyze table' in PostgreSQL, mostly paired with vacuum as far as I use it :)

@hnasr , if possible can you please do some live coding for building backend systems?

pretty sure in postgres ANALYZE updates table stats

This was so much fun!

We can explore internals on primary index built from multiple columns, maybe there is something interesting there

IF, A was not a primary key but had a clustered index , then what ? Once you find page for value 50 by doing a primary index scan for the value you got from A's index, every consecutive items in the page and the consecutive pages will have the required data (since it's clustered). BUT, is the database smart enough to know that it doesn't need to scan the primary index for each of the values which it finds in A's index ?

Hello, Just watched your video course on HA Proxy --> it's really good quality content. Thanks a lot for doing it 🙂

nice video, can you make one with the books from bookshelve explaining them?

Nice haircut. You look good.

First to comment

There's a typo in your chapter titles btw

Early