lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Yonik Seeley (JIRA)" <j...@apache.org>
Subject [jira] [Commented] (SOLR-8586) Implement hash over all documents to check for shard synchronization
Date Fri, 22 Jan 2016 17:38:39 GMT

    [ https://issues.apache.org/jira/browse/SOLR-8586?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15112751#comment-15112751
] 

Yonik Seeley commented on SOLR-8586:
------------------------------------

bq. My initial thought was that a bloom filter from one replica could be compared against
a bloom filter from another replica (bitwise), to arrive at the same checking. 

We'd need to figure out how big of a bloom filter would be needed to avoid a false match (no
idea, off the top of my head).

For adding up good hashes, 64 bits feels like it should be plenty.  We could always easily
extend that by accumulating in multiple buckets (the bucket being chosen by either a few bits
of the hash, or a completely different hash).

> 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-unsubscribe@lucene.apache.org
For additional commands, e-mail: dev-help@lucene.apache.org


Mime
View raw message