On Mon, 28 Dec 2009 08:07:18 -0700 Joe Stump <j...@joestump.net> wrote:
JS> The advantage of the random partitioner is that it randomly JS> distributes your keys across the cluster. This (theoretically) JS> avoids key clustering on nodes. The big disadvantage is that you JS> can't do key range operations. If each node does a key enumeration, can the results be aggregated somehow? It seems useful to get a list of all the keys across the cluster even if it's not 100% accurate. I didn't see discussions of such a feature in JIRA or in the archives of this list. Ted
