I don't think the big-O notation is appropriate to measure the cost of Lucene queries.
Le mer. 11 nov. 2015 à 20:31, search engine <searchstudy1...@gmail.com> a écrit : > 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 >
