Redis Deep Dive w/ a Ex-Meta Senior Manager 

🫡

So glad it was useful!

Kafka is in the works! Written resource will be posted to the website this week or early next!

Lol. The intro is a banger, no :)?

Kafka is in the works! Written resource will be posted to the website this week or early next!

@@hello_interview amazing!

Mock interviews are what we do! What is it you want to see?

We actually have an opinion on that very topic, check this out: www.hellointerview.com/learn/system-design/in-a-hurry/key-technologies#core-database

Good feedback, thank you! Will try to make the visuals more engaging in the future.

We'll put it on the list!

Cassandra is soon!

The latter!

What are you looking to see?

@@hello_interview DSA Mock Interviews with FAANG Candidates..

You should have chapters on this one! If you look at the description "Key Moments" will take you to the relevant sections. LMK if we're not doing something else we should be doing!

@@hello_interview I see that, you missed to add "00:00" time stamp in your "Key moments", that's causing YT to not auto chaptering your video. I have checked couple of other videos in the channel, videos which are having 00:00 in their key moments, respective chapters are added.

Send us an email at support@hellointerview.com and we might be able to make something work. Have some products planned here for people in your shoes.

@@hello_interview done

Splits the hot shard into multiple, so you can distribute that load across nodes.

@@hello_interview sorry, what's the approach? I think somewhere else in the video talks about it, but I also somehow did not understand that. Is it roughly the following? Generate X random suffixes. Maintain a map on the (Redis') client side of . Whenever we want to do some sort of "write", we get a random suffix from our list and append it to our key in the Redis command. Whenever we want to do some sort of "read", we get _all_ random suffixes (X of them) from our set, make X reads from Redis, and aggregrate on the client side. ---- Or maybe it's sometimes the opposite way. For example, in a cache, I'm guessing we'd want to write our value to each and every one of the key+randomsuffix. Then for a read, we can (randomly) pick one of the suffixes. ---- Maybe the missing link (for me and others similarly confused) is how/where the random suffixes are managed. There's also the question of how we (automatically?) identify a hotkey, or develop an algorithm that generates (or increases) the number of suffixes depending on some sort of access rate.

Written deep dive on Kafka coming in a couple days!!

In practice? Substantially faster and cheaper if you can accept some of the (many) compromises. In an interview setting it can be helpful to have a few multifaceted tools vs having to know all about Kafka (video on that soon). If your business was entirely built around append-only logs I probably wouldn't take Redis as an acceptable substitute, though it works in a pinch.

Check out our Whatsapp guide for one example of this: www.hellointerview.com/learn/system-design/answer-keys/whatsapp

Facts.

🤣

The GOAT has arrived and has something important to say!

@@hello_interview Gigachad onlyfans allocator (of) toes, that's very kind of you

Will add it to the list! Typically, graph dbs are not as commonly used at scale.

Which part is most confusing? Geohashing? Quad trees? Where to use them?

@@hello_interview Geohashing algorithm is too complex. I just cant take in all this diagrams. I also dont understand how proximity systems can search something inside the circle using square blocks of geohashes

@@maxvettel7337 Gotcha! I'll earmark this for follow-up. The nice thing is you don't necessarily need to know about the geohashing internals to use something like Redis' proximity search in practice!

This week!