|
From: Doug C. <cu...@ap...> - 2008-03-19 20:46:03
|
Yonik Seeley wrote: > Going with a long might be premature optimism that no one will need to > create or track by hash :-) I don't follow this. You mean create an array of all positions? > Going from 4 to 8 bytes per document could be significant. 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. We will be slinging around representations of the ring: the client will need to refresh its frequently. These will have a <position,position> range per node, so these would get bigger. But the ring also has to represent a host per node, plus each node's unique id and its ring position, so the size of the range is not dominant in the size of the ring. > 32 bits provides 4B slices of the ring! But, like IP addresses, having enough doesn't make them easy to divide. Doug |