Re:Algorithms Behind Modern Storage Systems
by dhd415 on Wednesday May 16, 2018 @07:14AM
(#17081477)
LSMs do not guarantee that sequential key/value pairs are stored in the same SSTable so reading "n" k/v pairs, in the worst case, could require seeking through "n" different SSTables. There are datastores that use LSMs such as HBase that provide guarantees on top of LSMs to facilitate efficient range reads and, of course, many LSM compaction algorithms improve range reads, but the basic LSM is optimized only for single k/v reads. That's the reason, for example, why Cassandra doesn't even offer range reads such as "SELECT * FROM mytable WHERE KEY > x AND key < (x + k)".
[ Parent
| on HN ]
Re:Algorithms Behind Modern Storage Systems
by misframer on Wednesday May 16, 2018 @03:44PM
(#17085788)
> That's the reason, for example, why Cassandra doesn't even offer range reads
This is not true. The reason why Cassandra doesn't support that is because of hashing of keys across the cluster -- you'd have to query all shards and merge the results. That has nothing to do with the LSM storage.