// Let's assume all main key is sorted ascendant, we can further
// optimize it to match one of the nested sort/distinct key, because we do not
// really care about how cogroup key are sorted; But it may not be the case
// if sometime we switch all the comparator to byte comparator, so just
// leave it as it is for now
result.insertColumnChainInfo(i, columnChainInfo, true);
}
return result;
}
public static SecondaryKeyOptimizerInfo applySecondaryKeySort(PhysicalPlan mapPlan, PhysicalPlan reducePlan) throws VisitorException {