4 ms·

But it's not necessary to keep data in Memory, because MergeTree works perfectly. Here is a slide deck showing why MergeTree is faster than in-memory tables: h

But it's not necessary to keep data in Memory, because MergeTree works perfectly. Here is a slide deck showing why MergeTree is faster than in-memory tables: https://presentations.clickhouse.com/meetup53/optimizations/ https://presentations.clickhouse.com/meetup53/optimizations/

ilyt 4y ago
Soooo did they just implement in memory store worse ?
- winrid 4y ago
  It's a database
ww520 4y ago
The comparison is done with the in-memory table doing full scan while MergeTree using an index. Kind of meaningless comparison.