So I'm asking the list. How can I
> search all name/sortName fields in a range between "A Balladeer*" TO "A
> Perfect Circle*" and get only terms back which are starting with that
> terms? Is there a way to accomplish that in Java and
is a good result, performance-wise.
> Can you provide a better solution and/or comment on my current one.
>
> The currend one is quite quick if no whitespace is contained in the search
> term,
> but requests are many times slower if there are whitespaces (usually normal
> spaces
eld)
doc{a} field{a} num_terms_in_field = 100, term appears 10 times in
field{a},doc{a}
score =~ 10/sqrt(100) = 1
doc{b} field{a} num_terms_in_field = 300, term appears 10 times in
field{a},doc{a}
score =~ 10/sqrt(300) = 0.577350269
Daniel Rosher
Developer
d: 0207 3489 912
t: 0870 2020 121
f: 08
-0700, Jay Yu wrote:
> what if I do not know all possible values of that field which is a
> typical case in a free text search?
>
> daniel rosher wrote:
> > You will be unable to search for fields that do not exist which is what
> > you originally wanted to do,
contains document matching the opposite of
that specified by the query, and can use in subsequent queries
Dan
On Tue, 2007-07-24 at 09:40 -0700, Jay Yu wrote:
>
> daniel rosher wrote:
> > Perhaps you can use a filter in the following way.
> >
> > -Create a filter (vi
--
> > To unsubscribe, e-mail: [EMAIL PROTECTED]
> > For additional commands, e-mail: [EMAIL PROTECTED]
>
> -
Hi Ofer,
I think your best option is to boost the field for your category field
during index time with Field.setBoost(floatBoost)
You will have to reindex your corpus however.
Regards,
Dan
On 4/2/07, Ofer Nave <[EMAIL PROTECTED]> wrote:
I'd like to be able to boost documents at search-time,
Hi CW,
You might find this email from Doug Cutting useful, not NFS but using rsync
and hard links ... besides NFS without failover introduces a single point of
faliure.
http://www.mail-archive.com/lucene-user@jakarta.apache.org/msg12709.html
Regards,
Dan
On 4/3/07, Chun Wei Ho <[EMAIL PROTECT
Hi Jonathon,
Since the number of users in your application is small, perhaps you could
apply a pre-generated filter per user, and apply this to the search, however
this won't scale well if the number of users grow.
Another idea might be to have several filters,each of which detail a
particular t
Hi Peter,
Shouldn't the search perform the euclidean distance during filtering as well
though, otherwise you will obtain perhaps highly relevant hits reported to
the user outside the range they specified? Particularly as the search radius
gets larger.
Cheers,
Dan
On 1/28/07, Peter Keegan <[EMAI
places the
production one, we determine f(D) for all documents so that for the user
there is almost no performance issue,i.e. f(D) is cached. I suspect you
can implement something similar.
Cheers,
Dan
On Fri, 2007-03-16 at 01:50 +, xiong wrote:
> daniel rosher hotonline.com> wr
scribe, e-mail: [EMAIL PROTECTED]
> For additional commands, e-mail: [EMAIL PROTECTED]
>
>
>
> <>
Daniel Rosher
Developer
d: 0207 3489 912
t: 0870 2020 121
f: 0870 2020 131
m:
http://recruiter.hotonline.com/
- - - - - - - - - - - - - - - - - - - - - - - - - -
Hi Peter,
Does this mean you are calculating the euclidean distance twice ... once for
the HitCollecter to filter
'out of range' documents, and then again for the custom Comparator to sort
the returned documents?
especially since the filtering is done outside Lucene?
Regards,
Dan
Joe,
Fields
13 matches
Mail list logo
