[
https://issues.apache.org/jira/browse/SOLR-8586?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15112734#comment-15112734
]
Ishan Chattopadhyaya commented on SOLR-8586:
--------------------------------------------
I see.. My initial thought was that a bloom filter from one replica could be
compared against another bloom filter from another replica (bitwise), to arrive
at the same checking. And also, it could be re-used later for other purposes,
if needed (maybe to find out a missing update, i.e. by running a loop over all
updates one replica has and comparing against the bloom filter of the replica
that has missing update; but haven't thought about this carefully enough).
However, your logic seems to do the needful and comparing two longs is surely
faster than two bit arrays (or two arrays of longs).
> Implement hash over all documents to check for shard synchronization
> --------------------------------------------------------------------
>
> Key: SOLR-8586
> URL: https://issues.apache.org/jira/browse/SOLR-8586
> Project: Solr
> Issue Type: Improvement
> Reporter: Yonik Seeley
>
> An order-independent hash across all of the versions in the index should
> suffice. The hash itself is pretty easy, but we need to figure out
> when/where to do this check (for example, I think PeerSync is currently used
> in multiple contexts and this check would perhaps not be appropriate for all
> PeerSync calls?)
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
