I forgot to include this question: What is the overhead of querying like this for just the first result, vs just getting with the key? What is the magnitude of difference in time?
On Jun 12, 4:22 pm, Oliver Zheng <goo...@oliverzheng.com> wrote: > Is it a hash function in that the resulting string is randomly > distributed among its range? It seems like in a distributed hash table > like BigTable, this would be how it's implemented. > > The reason I'm asking is, I want to do a random query. I want to > select a random entity from an entity group. I thought if the key is > distributed like this, then I could generate a random string like it > myself, and simply query for the first result bigger than this. Is > this viable? > > Thanks. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Google App Engine" group. To post to this group, send email to google-appengine@googlegroups.com To unsubscribe from this group, send email to google-appengine+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/google-appengine?hl=en -~----------~----~----~----~------~----~------~--~---
