Badger talks about keys being in-memory when doing key only iteration "It is several order of magnitudes faster than regular iteration, because it involves access to the LSM-tree only, which is usually resident entirely in RAM"
Obviously at some point there isnt enough memory, but is there some strategy for having "all" keys in memory in the skiplist structure. See issue on key compression as well.
Badger talks about keys being in-memory when doing key only iteration "It is several order of magnitudes faster than regular iteration, because it involves access to the LSM-tree only, which is usually resident entirely in RAM"
Obviously at some point there isnt enough memory, but is there some strategy for having "all" keys in memory in the skiplist structure. See issue on key compression as well.