Major Description
SARG creation in ORC, applies several optimizations to expression tree. In that CNF conversion is an exponential algorithm as it finds all combinations of expressions when converting from OR of AND form to AND of OR form (CNF). We need an upper bound for this algorithm to prevent it from running for long time and generating huge combinations list.