Re: [bailey-developers] lattice master

[Doug C. <cu...@ap...>]

Yonik Seeley wrote:
> I think one problem we are running into is due to using the same hash
> ring for both partitioning the key space and selecting placement of
> those keys.  Putting many virtual nodes on the hash ring to make the
> hash function fair, in conjunction with using that hash ring to do
> replication, causes all the indicies to be mixed together.

That's a feature, not a bug!  Seriously, I'm not sure what your concern 
here is.  If documents are indexed in the N nodes clockwise from their 
point, then we do get documents indexed together, but we don't need to 
search but every Nth index (in most cases).  So I don't see the problem. 
  What am I missing?

When a new node is introduced to the ring, then it will need to ask its 
neighbors for the documents assigned to it, and ranges for search should 
not be re-assigned until it has completed retrieving and indexing these. 
  Similarly, when a node is removed or declared dead then others will be 
assigned new ranges to construct from neighbors.

Doug