|
From: Yonik S. <yo...@ap...> - 2008-03-19 21:06:19
|
On Wed, Mar 19, 2008 at 4:46 PM, Doug Cutting <cu...@ap...> wrote: > A Document is uniquely identified by a String externalId and a long > version. The position is not assumed to uniquely identify it. So I'm > not sure where the size of the position will be significant. I'm not exactly sure yet either... but it seems like a node does need to identify all documents within certain arbitrary ranges at some point for rebalancing (and perhaps for filtering too). Will the hash be indexed, stored somehow, or calculated on the fly on the node? > > 32 bits provides 4B slices of the ring! > > But, like IP addresses, having enough doesn't make them easy to divide. True... I guess it depends on if those 32 bits will be used for anything other than a hash (or position) by the application level. -Yonik |