c,4)
(d,6)
(e,10)
Is this already possible? If not, any tips on how I can approach
implementing this requirement?
Thanks,
--
Arvind Kalyan
wrote:
> Hi
>
> You can use SortingMergePolicy and SortingAtomicReader to achieve that. You
> can read more about index sorting here:
> http://shaierera.blogspot.com/2013/04/index-sorting-with-lucene.html
>
> Shai
>
>
> On Wed, Oct 23, 2013 at 8:13 PM, Arvind Kaly
performs well when
> the two segments are already sorted.
> Anyway, that's the way to do it, even if it looks like it does more work
> than it should.
>
> Shai
>
>
> On Wed, Oct 23, 2013 at 10:46 PM, Arvind Kalyan wrote:
>
> > Thanks, my understanding
On Wed, Oct 23, 2013 at 2:45 PM, Adrien Grand wrote:
> Hi,
>
> On Wed, Oct 23, 2013 at 10:19 PM, Arvind Kalyan wrote:
> > Sorting is not an option for our case so we will most likely implement a
> > variant that merges the segments in one pass. Using TimSort is great but
&g
ry but I'd like to hear from folks here
what your experience has been and what you did to speed up your
IndexSearchers to improve throughput *and/or* latency.
Thanks!
--
Arvind Kalyan
http://www.linkedin.com/in/base16
ormance
> > improvements for large, single-segment, atomicreaders.
> >
> > I'll share more specifics if necessary but I'd like to hear from folks
> here
> > what your experience has been and what you did to speed up your
> > IndexSearchers to improve through
ine has 64GB RAM.
I'm going to repeat the experiment with just Lucene (and no jetty) as what
Mike suggested but meanwhile if any of you have any other pointers it'd be
great.
Thanks
--
Arvind Kalyan
http://www.linkedin.com/in/base16
es are for boolean queries that don't
> access any stored fields, but just do a posting list lookup on 3 tokens.
>
> Any ideas on what could be wrong here?
>
> Thanks in advance,
> Prasad.
>
--
Arvind Kalyan
http://www.linkedin.com/in/base16
cell: (408) 761-2030
