Details
-
Improvement
-
Resolution: Won't Fix
-
Major - P3
-
None
-
None
Description
The implementation can be refactored, and also there has been a note in the code since this class was created suggesting that additional optimizations may be implemented. The optimizations fall into two categories:
- some btree skips that are applied for range bounds may be optimized out for $in bounds (in some cases they are already optimized out)
- in some cases fewer comparisons could be performed by the implementation
Attachments
Issue Links
- is related to
-
SERVER-2236 optimize btree scanning more
-
- Closed
-
-
SERVER-5063 $in on first compound key element and limit efficiency
-
- Closed
-