Thanks. It's not what I need, but would have it mind.
Sorry, my statement was not clear. I have already replied to Thomas with
further details.
thanks you all
rodolfo
On Tue, Aug 31, 2021, 9:08 AM Andrew Hankinson
wrote:
> You could use the UUIDUpdateProcessorFactory to automatically add a U
You could use the UUIDUpdateProcessorFactory to automatically add a UUID to
each document and use that as the tie-breaker field.
https://solr.apache.org/guide/8_1/update-request-processors.html#uuidupdateprocessorfactory
The chances of collision of UUIDs is well-known, and highly unlikely.
http
hi,
> Random ≠ unique.
Agree. They are not the same. I don't want a tie breaker, I want to know
how many ties I would face.
The implementation where it's being used has some other (posterior) sorting
criteria. So the question can be rephrased as whether posterior orders have
any effect or not.
Hi Rodolfo
Random ≠ unique. If you really need a tie breaker, you'll have to sort on
the uiqueKey field.
What is your use case here? When using a cursor, sorting on a random field
will yield confusing results.
Thomas
Op ma 30 aug. 2021 om 17:33 schreef rgamarra :
> Hi there! I'm using random f
