query complexity

[search engine]

Hi,

I've been thinking how to use big O annotation to show complexity for
different types of queries, like term query, prefix query, phrase query,
wild card and fuzzy query. Any ideas?

thanks,
Zong