Hi all,
I am facing a massive rewrite, so I wanted to get some validation
before I strap on my lucky boots and go kick the crap out of my code.
(by which I mean refractor it after some serious pondering)
My program stores data in a tree structure, a user could have several
trees. Currently I have an entry in the datastore for each node. I can
walk up and down the tree, fetching nodes and I can do everything I
want to and all is fine.
Except that it hits the datastore loads.
I am considering re-plumbing it so that each whole tree is a data
store entry.
(unless it was over a certain size, in which case I would break a
nodes children out to a new data store entry)
So if a user needed the data for a specific node, then its appropriate
tree would be loaded from memcache or the datasore, and then the data
would be returned to the user.
Just for background - I am a basic level python user. (only use it in
my free time).
Ok… my questions…
- Does this seem reasonable to you? (My original architecture was very
stuck in how I would have managed the data in a relational database)
- Any caveats or things I should be aware of? (binary or JSON
serialisation performance, that kind of thing)
- Any thoughts on how I should address nodes? (Currently they have a
convenient ID which my client side code can use to identify which node
to do something to)
- I will most likely use guids, but they seem a bit heavy
Thanks very much
J
--
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.
