Search for strings matching the pattern “abc:*:xyz” in less than O(n)

Question

Given a bunch of strings I need to find those which match 3 kinds of patterns:

• Prefix search - abc*
• Glob-like pattern - abc:*:xyz
• Suffix sear

Answer 1

Wouldn't an intersection of the results from the other two queries give you exactly that? And since each of the results is O(log N) and an intersect over that result set is O(N) in the result-set size, wouldn't the total also be an O(log N) over the original problem?