Compiler probe MJ selection candidate fallback

As per discussion on #1286 current probe MJ selection algorithm:

• selects best MJ candidate (currently based on the distinct row ratio)
• does some further processing - which may bail out

Bailing out for the best candidate doesn't necessarily mean that we can not use a less charming candidate. The extra compilation can be wrapped into to for loop instead of selecting the best candidate the first part could be implemented as a priority logic