use one is ok. solrCloud will route it, but use cloudserver is a good choice.
--
View this message in context:
http://lucene.472066.n3.nabble.com/SolrCloud-distributed-indexing-tp4138600p4139700.html
Sent from the Solr - User mailing list archive at Nabble.com.
If you are using Java to index/query, then use CloudSolrServer which
accepts the ZooKeeper connection string as a constructor parameter and it
will take care of routing requests and failover.
On Thu, May 29, 2014 at 2:41 PM, Priti Solanki wrote:
> Hi,
>
> How to achieve distributed indexing in s
On Thu, Sep 9, 2010 at 11:51 AM, Grant Ingersoll wrote:
> On Sep 6, 2010, at 10:41 AM, Yonik Seeley wrote:
>> For SolrCloud, I don't think we'll end up using consistent hashing -
>> we don't need it (although some of the concepts may still be useful).
>
> Can you elaborate on why we don't need it?
On Sep 6, 2010, at 10:41 AM, Yonik Seeley wrote:
>
> For SolrCloud, I don't think we'll end up using consistent hashing -
> we don't need it (although some of the concepts may still be useful).
Can you elaborate on why we don't need it?
I must add something to my last post:
When saying it could be used together with techniques like consistent
hashing, I mean it could be used at indexing time for indexing documents,
since I assumed that the number of shards does not change frequently and
therefore an ODV-case becomes relatively i
What if we do not care about the version of a document at index-time?
When it comes to distributed search, we currently decide aggregating
documents based on their uniqueKey. But what would be, if we decide
additionally decide on uniqueKey plus indexingDate, so that we only
aggregate the last ind
e:
> From: Markus Jelsma
> Subject: RE: Re: SolrCloud distributed indexing (Re: anyone use hadoop+solr?)
> To: solr-user@lucene.apache.org
> Date: Monday, September 6, 2010, 2:53 PM
> The remainder of an arithmetic
> division
>
> http://en.wikipedia.org/wiki/Modulo_
The remainder of an arithmetic division
http://en.wikipedia.org/wiki/Modulo_operation
-Original message-
From: Dennis Gearon
Sent: Mon 06-09-2010 22:04
To: solr-user@lucene.apache.org;
Subject: Re: SolrCloud distributed indexing (Re: anyone use hadoop+solr?)
What is a 'simpl
On 2010-09-06 22:03, Dennis Gearon wrote:
What is a 'simple MOD'?
md5(docId) % numShards
--
Best regards,
Andrzej Bialecki <><
___. ___ ___ ___ _ _ __
[__ || __|__/|__||\/| Information Retrieval, Semantic Web
___|||__|| \| || | Embedded Unix, System
What is a 'simple MOD'?
Dennis Gearon
Signature Warning
EARTH has a Right To Life,
otherwise we all die.
Read 'Hot, Flat, and Crowded'
Laugh at http://www.yert.com/film.php
--- On Mon, 9/6/10, Andrzej Bialecki wrote:
> From: Andrzej Bialecki
&
On 2010-09-06 16:41, Yonik Seeley wrote:
On Mon, Sep 6, 2010 at 10:18 AM, MitchK wrote:
[...consistent hashing...]
But it doesn't solve the problem at all, correct me if I am wrong, but: If
you add a new server, let's call him IP3-1, and IP3-1 is nearer to the
current ressource X, than doc x wi
On Mon, Sep 6, 2010 at 10:18 AM, MitchK wrote:
[...consistent hashing...]
> But it doesn't solve the problem at all, correct me if I am wrong, but: If
> you add a new server, let's call him IP3-1, and IP3-1 is nearer to the
> current ressource X, than doc x will be indexed at IP3-1 - even if IP2-1
Andrzej,
thank you for sharing your experiences.
> b) use consistent hashing as the mapping schema to assign documents to a
> changing number of shards. There are many explanations of this schema on
> the net, here's one that is very simple:
>
Boom.
With the given explanation, I understan
13 matches
Mail list logo
