You are viewing a plain text version of this content. The canonical link for it is here.

Posted to dev@jackrabbit.apache.org by Bertrand Delacretaz <bd...@apache.org> on 2007/08/13 09:23:21 UTC

Re: improving the scalability in searching part 2

On 8/8/07, Ard Schrijvers <a....@hippo.nl> wrote:
> ...2) The XPath jcr:like implementation, for example : //*[jcr:like(@mytext,'%foo bar qu%')]
> ...the current jcr:like results in queries taking up to 10 seconds to complete for only
> 1000 nodes with one property, "mytext" which is on average 500 words long....

Just curious, is

  %foo bar qu%

much slower than

  foo bar qu%

?

I'd guess so, as Lucene-based indexes are usually inefficient with
leading wildcards. Do your tests confirm that?

-Bertrand