Thanks. But using memcache would give me a somewhat "fragile" counter
as it's memory-only. However, I stumbled upon Jeff Scudder's
implementation of a sharded counter, which is exactly what I'm looking
for. But... Shouldn't the code that 1) fetches a shard, and 2)
increases it, be encapsulated in a transaction in order to prevent
other users to make an update between 1) and 2)? Is his implementation
really "thread safe"?

The increment-code can be seen in
  demos/shardedcounter/src/com/google/appengine/demos/shardedcounter/
v3/ShardedCounter.java
in the App Engine SDK.

-- 
You received this message because you are subscribed to the Google Groups 
"Google App Engine" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to 
[email protected].
For more options, visit this group at 
http://groups.google.com/group/google-appengine?hl=en.

Reply via email to