Before revision:  We begin with the class of lexicographic orderings and give a decidable characterization  of the class of feasible such orderings for every CQ without self-joins.
After revision:  We begin with the class of lexicographic orderings and give a decidable characterization (under conventional complexity assumptions) of the class of feasible such orderings for every CQ without self-joins.