I had spend some time today with building tree structure using datastore. I need a real tree, for real world, so there must be a possibility to move node with all descendants. There must also be a quick way to find all ancestors, children and descendants.
So, datastore keys can not be used for tree like this - because key can not change, and i would like to prevent node copying/deletion, because this must be always done on node and all its descendants which may end up with tons of sql queries. Design i made should fit for me, but maybe there is some common solution for this problem... Anybody knows about some optimal solution? (i can not use serialization) Thanks a lot! --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
