Details
-
Improvement
-
Status: Open
-
Major
-
Resolution: Unresolved
-
None
-
None
-
None
-
None
Description
There's some low hanging fruit to optimize queries based on bytes scanned (i.e. StatementPlan.getEstimatedBytesToScan).
Attachments
1.
|
Base hash versus sort merge join decision on cost | Resolved | Wei Xue | |
2.
|
Fallback to many-to-many join if hash join fails due to insufficient memory | Open | Wei Xue | |
3.
|
Indexes not used when ordering by primary key | Resolved | Wei Xue | |
4.
|
Use bytes scanned to drive join order | Open | Unassigned | |
5.
|
Refine cost for limit | Open | Wei Xue |