3 ms·
But isn't that the "wrong" store to use (as far as performance is concerned) when you want random, row-level access?
by stavros 4y ago
But isn't that the "wrong" store to use (as far as performance is concerned) when you want random, row-level access?
- AdamProut 4y agoColumnstores can do row level access by trading off a bit in terms of compression. If you organize the columnstore files as an LSM tree and use incremental compression schemes (so you don't have to compress too many more rows then the one your after) it can get close to the performance of a B-Tree for point reads - it depends on the specific table schema. [1] https://dl.acm.org/doi/abs/10.1145/3514221.3526055 https://dl.acm.org/doi/abs/10.1145/3514221.3526055