I would say:
- FROM (including potential subselects)
- WHERE
- SETs and MEMBER location in the WITH clause
- Build the list of tuples for all query axes (columns, rows, ...) in parallel, ignoring NON EMPTY and HAVING
- Cell values for all axis intersections
- Remove tuples from the axes as requested by NON EMPTY and HAVING for each axis.
By "member location" in step 3, I mean the information that the member exists at all, and in which hierarchy and possibly under which parent it is located in the hierarchy. This does not involve the member definition expression. That will be evaluated in step 5 and 6. But the location is needed for step 4.
The parallel evaluation of the axes means that there is no relation between axes in the query processing.
Also note that this is the conceptual view. Physically, step 6 may happen during the processing of step 4, or whatever the optimizer decides is a proper execution order, as long as the result would be the same.
与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…