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.
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"?
![เบิ้ล ปทุมราช - อ้ายกินดอง น้องลาบงัว ft. สแน็ก อัจฉรีย์ [OFFICIAL MV]](http://i.ytimg.com/vi/-OK--KaSPcI/mqdefault.jpg)
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.
Oops if I said that, agreed since it forks postgres iirc
Nice content, Jordan.
Keep it coming.
The audio is very very low.
Ah shit sorry about that I'll have it fixed for next time
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.
Fair - when I have time I will eventually need to paste all the resources in 2.0
Waiting for a collab my man. 🙌
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"?
I imagine a separate file path yeah.
need to wear a mask like MF doom
Yeah it's a shame I'm in too deep now
Do you have a discord / telegram / linkedin id?
www.linkedin.com/in/jordan-epstein-69b017177