Thanks!
I'll have a look at that.
On Wed, Apr 2, 2008 at 6:25 AM, Chris Hostetter [EMAIL PROTECTED]
wrote:
: I am computing a sorted rank list and returning a slice (for pagination)
but
: have to recompute the result for each request, although the actual q
: parameter and fq would be
: I am computing a sorted rank list and returning a slice (for pagination) but
: have to recompute the result for each request, although the actual q
: parameter and fq would be cached but not the sorted list which I could cache
: to reuse on subsequent requests.
:
: I might have a look at the
Hi,
it took me some but I implemented the required function by developing a
custom plugin for our specific example. However Now I have another issue:
I am computing a sorted rank list and returning a slice (for pagination) but
have to recompute the result for each request, although the actual q
: I have a problem of returning an list of results which is sorted on a
: average of ranks returned from aggregates.
: the qury would be something like ?
: q=product:p1+product:p2+product:p3; sort score desc
: To explain Supose I have documents with fields Product, Manufacturer, Rank
: and I want
Hi,
I have a problem of returning an list of results which is sorted on a
average of ranks returned from aggregates.
the qury would be something like ?
q=product:p1+product:p2+product:p3; sort score desc
To explain Supose I have documents with fields Product, Manufacturer, Rank
and I want to
