How Converged Indexes makes Rockset super-efficient in all kinds of queries | Rockset Internals

Build Your Own Redis / DNS / BitTorrent / SQLite - with CodeCrafters.

# Recommended videos and playlists

If you liked this video, you will find the following videos and playlists helpful

# Things you will find amusing

# Other socials

I keep writing and sharing my practical experience and learnings every day, so if you resonate then follow along. I keep it no fluff.

Thank you for watching and supporting! it means a ton.

I am on a mission to bring out the best engineering stories from around the world and make you all fall in
love with engineering. If you resonate with this then follow along, I always keep it no-fluff.

[CyberSoundStation]

Thanks for explaining. It looks like the converged indexing thing slows down writes more than regular indexing because it's maintaining columnar, row, and search indexes. But it makes the query execution engine happy, getting all the good stuff from both indexing schemes.

[AbhijeetSachdev]

Arpit this is not allowed, you are blowing my mind.

[tarangchikhalia]

Thanks for this amazing explanation. I am curious to know how the insertion and deletion is handled. You mentioned the index is ordered. What happens if the new object is added/deleted. Does the index reorder? Is it using the linkedlist data structure for the index to make the insertion/deletion efficient?

[LeoLeo-nxgi]

Hi Arpit, thanks a ton!! You explained it in such an awesome way!! Thanks for such grt insights....

[raj_kundalia]

This is fascinating. Thank you for doing this!

[namantyagi]

When the older indexes are flushed to Disk as SST, will the read not be slower since the query will have to go thru all the SSTs to find the data? @AsliEngineering

[samj]

Did you get coding questions when you were interviewed for Staff role at Google ?
I am curious as you were already so senior at Unacademy at that time.
Have you shared your interview experience anywhere, would like to refer.
Shall be thankful for your