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
: 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 -
Mostly I'm just trying to understand. For the moment I'm putting
together a design for distributed Lux (XQuery backed by Solr Cloud). My
motivation is that I am feeding results into its separate XQuery system,
and that requires a consistent global document ordering. The ordering
can be arbitr
"*:*" is a constant score query - every document has the same score, so the
concept of relevancy has no relevance.
But, in theory, you could apply boost queries and function queries to scale
or offset those constant scores. If so, then you should see relevancy
sorting, otherwise the concept of
