On 12/5/2011 6:57 PM, Jamie Johnson wrote:
Question which is a bit off topic. You mention your algorithm for
sharding, how do you handle updates or do you not have to deal with
that in your scenario?
I have a long running program based on SolrJ that handles updates. Once
a minute, I run thro
Shawn,
Question which is a bit off topic. You mention your algorithm for
sharding, how do you handle updates or do you not have to deal with
that in your scenario?
On Sat, Dec 3, 2011 at 1:54 PM, Shawn Heisey wrote:
> In another thread, something was said that sparked my interest:
>
> On 12/1/2
On Mon, Dec 5, 2011 at 3:28 PM, Shawn Heisey wrote:
> On 12/4/2011 12:41 AM, Ted Dunning wrote:
>
>> Read the papers I referred to. They describe how to search fairly
>> enormous
>> corpus with an 8GB in-memory index (and no disk cache at all).
>>
>
> They would seem to indicate moving away from
On 12/4/2011 12:41 AM, Ted Dunning wrote:
Read the papers I referred to. They describe how to search fairly enormous
corpus with an 8GB in-memory index (and no disk cache at all).
They would seem to indicate moving away from Solr. While that would not
be entirely out of the question, I don't
On Sat, Dec 3, 2011 at 6:36 PM, Shawn Heisey wrote:
> On 12/3/2011 2:25 PM, Ted Dunning wrote:
>
>> Things have changed since I last did this sort of thing seriously. My
>> guess is that this is a relatively small amount of memory to devote to
>> search. It used to be that the only way to do this
On 12/3/2011 2:25 PM, Ted Dunning wrote:
Things have changed since I last did this sort of thing seriously. My
guess is that this is a relatively small amount of memory to devote to
search. It used to be that the only way to do this effectively with
Lucene based systems was to keep the heap rel
On Sat, Dec 3, 2011 at 10:54 AM, Shawn Heisey wrote:
> In another thread, something was said that sparked my interest:
>
> On 12/1/2011 7:17 PM, Ted Dunning wrote:
>
>> Of course, resharding is almost never necessary if you use micro-shards.
>> Micro-shards are shards small enough that you can f
