Re: distributed query result order tie break question

2013-09-03 Thread Michael Sokolov
On 09/03/2013 12:50 PM, Chris Hostetter wrote: : like to understand how the ordering is defined so that I can compute an : integer that is sorted in the same way. For example (shard "id" << 24) | : docid or something like that. If you want to ensure a consistent ordering, you have to index a (u

Re: distributed query result order tie break question

2013-09-03 Thread Chris Hostetter
: like to understand how the ordering is defined so that I can compute an : integer that is sorted in the same way. For example (shard "id" << 24) | : docid or something like that. If you want to ensure a consistent ordering, you have to index a (unique) value that you use as a secondary sort -

Re: distributed query result order tie break question

2013-09-02 Thread Michael Sokolov
an explanation for what you are seeing, or a guarantee that you will always see that behavior? -- Jack Krupansky -Original Message- From: Michael Sokolov Sent: Monday, September 02, 2013 7:42 PM To: solr-user@lucene.apache.org Subject: distributed query result order tie break question

Re: distributed query result order tie break question

2013-09-02 Thread Jack Krupansky
Jack Krupansky -Original Message- From: Michael Sokolov Sent: Monday, September 02, 2013 7:42 PM To: solr-user@lucene.apache.org Subject: distributed query result order tie break question My question is about how query results are ordered in a distributed query when sorting by "releva

distributed query result order tie break question

2013-09-02 Thread Michael Sokolov
My question is about how query results are ordered in a distributed query when sorting by "relevance" and all the documents have the same score, for example, when querying for "*:*". It looks to me as if score ties are broken by shard and then within each shard, by docid. So for example, if I