How are Time Series Databases SO FAST? | Systems Design Interview 0 to 1 With Ex-Google SWE

[@AizazShahid-ck8cn]

TimescaleDB does not use LSM + SST, it uses B-trees. The writes/reads are still fast as the part that we are usually interested in is the latest chunk, for which the index tree can be loaded into memory.

[@jordanhasnolife5163]

Oops if I said that, agreed since it forks postgres iirc

[@2005kpboy]

Nice content, Jordan. Keep it coming.

[@Iwannayoucry]

One of the advantages that was in the old videos on design systems is that in some videos there are links to recommended resources for studying.

[@jordanhasnolife5163]

Fair - when I have time I will eventually need to paste all the resources in 2.0

[@fgbeast5805]

The audio is very very low.

[@jordanhasnolife5163]

Ah shit sorry about that I'll have it fixed for next time

[@recursion.]

Waiting for a collab my man. 🙌

[@kamalsmusic]

So is each chunk table like its own file on the disk, how is that part stored? Like given a time query and a sensor value, how do we locate the appropriate chunk table"?

[@jordanhasnolife5163]

I imagine a separate file path yeah.

[@yumnaakhtar1643]

would this be useful for storing historical data for stock prices where we need to aggregate for ex 1m,5m,1hr etc

[@jordanhasnolife5163]

For sure

[@chaitanyatanwar8151]

Thanks

[@AlfredGuimaz]

need to wear a mask like MF doom

[@jordanhasnolife5163]

Yeah it's a shame I'm in too deep now

[@sdemockinterview322]

Do you have a discord / telegram / linkedin id?

[@jordanhasnolife5163]

www.linkedin.com/in/jordan-epstein-69b017177