Details
-
Sub-task
-
Status: Closed
-
Major
-
Resolution: Done
-
v2.1.0
-
None
-
None
Description
Rather than depending on static rules to define a parent-child relationship between cuboids, a cuboid tree can be constructed for this relationship. In this tree, the root is the base cuboid. For a cuboid, it may have many legal parent cuboids. We should choose the best parent cuboid as its parent in this tree. Then how to define the best? It's related two rules as follows:
- If we know the row count, choose the one with the least row count
- Otherwise, choose the smallest cuboid
Based on the cuboid tree, we introduced a new cuboid scheduler called TreeCuboidScheduler. And both cube building & query can be based on TreeCuboidScheduler.
Attachments
Issue Links
- Blocked
-
KYLIN-2783 Refactor CuboidScheduler to be extensible
- Closed