-
Type:
Improvement
-
Resolution: Fixed
-
Priority:
Major - P3
-
Affects Version/s: None
-
Component/s: None
-
None
-
Query Optimization
-
Fully Compatible
-
0
-
None
-
None
-
None
-
None
-
None
-
None
-
None
Implement Yao's formula for number of distinct pages requested from a b-tree and invoke this estimation for both the INLJ probe into the collection.
- related to
-
SERVER-122916 [Join Optimization] Index scan costing - don't consider each fetched document a random IO
-
- Closed
-
-
SERVER-122265 [Join Optimization] Costing of INLJ ignores cost of sorted-sparse I/O to fetch records from collection
-
- In Progress
-