3 ms·
Would love to hear some of the lessons learned...
by Afton 9y ago
Would love to hear some of the lessons learned...
- k__ 9y agoTheir main idea was that B-Trees are slow and LSMs are fast. This was a partially right assumption, but only for writes. If you write something in a DB you check some constraints and those checks are reads. So most DB writes come with a bunch of reads. The reads were slower with the LSMs, so the B-Trees performed better in "real world" writes (which come with reads) and LSMs only performed better in "artificial" writes (without reads).
- jpetso 9y agoI found these slides: https://www.slideshare.net/InsightTechnology/dbtstky2017-c23-sqlite https://www.slideshare.net/InsightTechnology/dbtstky2017-c23...