Mailing-List: contact lucy-user-help@incubator.apache.org; run by ezmlm
Precedence: bulk
Reply-To: lucy-user@incubator.apache.org
Received-SPF: pass (nike.apache.org: domain of gorankent@gmail.com designates
 209.85.212.41 as permitted sender)
MIME-Version: 1.0
In-Reply-To: 
 <CAFAN8vz_1i18HCH-P_yu=W3_ZsPHwTs9Rk5NqrR-kGje9_x0WA@mail.gmail.com>
References: 
 <CAKn6EF_aSgY2ho95uhOkp8L4Lre6SZj7ESCCvzPaWAhRsLW-Hw@mail.gmail.com>
	<CAFAN8vz_1i18HCH-P_yu=W3_ZsPHwTs9Rk5NqrR-kGje9_x0WA@mail.gmail.com>
Date: Fri, 9 Sep 2011 08:47:20 +0200
Message-ID: 
 <CAKn6EF8+OPufw80CTNOS=Kny_qA4Z+0Pr0dT02t7MAFbznNKkw@mail.gmail.com>
From: goran kent <gorankent@gmail.com>
To: lucy-user@incubator.apache.org
Content-Type: text/plain; charset=ISO-8859-1
Content-Transfer-Encoding: quoted-printable
Subject: Re: [lucy-user] Lucy questions wrt production, ranking, etc

Thanks for the quick response Nathan!  See question below.

On Thu, Sep 8, 2011 at 9:58 PM, Nathan Kurz <nate@verse.com> wrote:
>
>> The environment is distributed search across a cluster with the intent
>> of keeping search-time sub-second - 3s at most (folks are spoilt by
>> the elephant in the industry, so they lose interest if the page does
>> not return in that time).
>>
>> I see from the docs that distributed search is supported, else it
>> would be a non-starter.
>
> This excites me too, but I don't know that anyone is pushing it's
> limits yet. =A0But architecturally, I think it's well designed to allow
> really fast clusters of in-ram search. =A0Talking about 3 seconds makes
> it sound like you're willing to hit disk: =A0you might need some intense
> tuning here, depending on how you deal with really common stopwords.
> =A0Also, there are some limitations with custom sort ordering and the
> like: =A0clusters are going to deal better with floating point than with
> alphabetical, for example, and

> ... excerpts might be a little clunky to
> retrieve. =A0Currently it's just a DocID and a score that get returned
> efficiently.

Just to clarify - is obtaining excerpts from a distributed search a
problem?  One would think irrespective of whether you're performing a
local or distributed search the modus operandi would be the same
(without coding gymnastics required to glue things together to work as
expected).