lucene-java-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From search engine <searchstudy1...@gmail.com>
Subject Re: lucene query complexity
Date Fri, 20 Nov 2015 19:09:53 GMT
What if we have some assumptions. For example, we assume that we have only
one segment and the entire segment is in memory ?

thanks,
Zong

On Fri, Nov 20, 2015 at 4:38 AM, Adrien Grand <jpountz@gmail.com> wrote:

> 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 <searchstudy1111@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
> >
>

Mime
  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message