Fixpoint3.Phase.IndexSelection.AutomaticIndexSelection

Find the minimum set of indexes that covers searches.

Using the example from earlier S={{0, 1}, {0, 1, 2}, {0, 2}} can be covered by {0 < 1 < 2, 0 < 2}. {0, 1, 2} and {0, 2} are trivially covered as they are explicitly in the set. {0, 1} is covered as the index {0, 1, 2} allows prefix searches.

{0 < 1 < 2} does not cover {0, 2} as no permutation of {0, 2} is a prefix of {0 < 1 < 2}.