Details
-
Improvement
-
Status: Open
-
Normal
-
Resolution: Unresolved
-
None
Description
Based on this;
http://rocksdb.org/blog/431/indexing-sst-files-for-better-lookup-performance/
By keeping pointers from the sstables in lower to higher levels we could reduce the number of candidates in higher levels, ie, instead of searching all 1000 L3 sstables, we use the information from the L2 search to include less L3 sstables.
First we need to figure out if this can beat our IntervalTree approach (and if the win is worth it).