Hi James,
>From one side, it is easy - you simply enumerate all the found objects,
and for each object retrieve the field Supervisor, sorting and removing
duplicates on the fly.
>From the other side, this way you'll get linear performance, and even
worse - retrieving fields is not a very fast oper
Hi,
That's somewhat strange, if I remember correctly the index size was 6
Gb, wasn't it?
I saw posts from people working with tens of Gb indexes. And we worked
with index of 8 Gb in 32-bit JVM (on Windows 2000) with as little as 700
Mb of max memory allowed to JVM.
Are there too many documents/t
, and cannot be changed on the fly.
Best Regards,
Andrew
--
Andrew Schetinin
C++ System Architect
Phone: +972 8 643 6560, ext. 212
Email: mailto:[EMAIL PROTECTED]
www.entopia.com
Entopia Awards:
"Visionary in Enterprise Search Magic Quadrant" Gartner Group
"Best Searc
Hi Samuru,
No, it is a part of a bigger project (quite small part), and nobody is
going to sell parts of it, at least for less than $X00,000 :-)
Best Regards,
Andrew Schetinin
-Original Message-
From: Samuru Jackson [mailto:[EMAIL PROTECTED]
Sent: Monday, March 06, 2006 5:05 PM
To
more or less evenly
distributed.
But the problem exist, and probably in the future we will think how to
handle it.
The documents are distributed across the machines randomally, and
merging the results becames a little head pain :-)
Best Regards,
Andrew Schetinin
ynonyms.
We think that we got a relatively good solution for the synonyms search.
We like the search results we get now after implementing this idea.
We're looking forward to hear your opinions and other ideas.
I will be happy to answer your questions, either in this mailing list or
at my other
