@Sameer A bit-map for holding the "list" of read/unread is a pretty common and widely used pattern. http://en.wikipedia.org/wiki/Bit_array Also see data structure and algorithm books.
You can think of the bitmap as a compact list of all read/unread assuming that the entries can be encoded with a key that increments or something like that. Then, and this is the part I don't know how to do offhand, if you could efficiently get an actual list from that bitmap (expanding it), then you could do a batch get by key. Something more realistic might be to find the first 0, then get the next n 0's, get those in batch by key, then get whatever else might be needed using an ajax pattern, i.e. "later". I am not sure this advances the discussion any. The idea is half-baked at best. On Jan 17, 12:28 pm, "sameer.mhatre" <[email protected]> wrote: > @Jay > As you have mentioned in the post about "bit-map or other compressed data > structure to hold read/unread info". Can you give an example for it or else > any link which provides implementation for bit-map thing. -- 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.
