jackrabbit-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Bertrand Delacretaz" <bdelacre...@apache.org>
Subject Re: improving the scalability in searching part 2
Date Mon, 13 Aug 2007 07:23:21 GMT
On 8/8/07, Ard Schrijvers <a.schrijvers@hippo.nl> wrote:
> ...2) The XPath jcr:like implementation, for example : //*[jcr:like(@mytext,'%foo bar
> ...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?


View raw message