On Tue, Dec 20, 2011 at 2:31 PM, Seth Johnson <[email protected]> wrote: > On Tue, Dec 20, 2011 at 1:39 PM, Kent Tenney <[email protected]> wrote: >> >> It sounds like the moral equivalent of a linked list. >> >> The "address" approach I've been leaning towards feels more >> robust / useful, but I haven't implemented with it, so I really >> don't know. It seems like what you describe is closer to the >> "node and edge" world view that graph software uses. >> >> In the web framework world there is a similiar dichotomy, >> mapping urls to content vs. traversing url paths.
Reading more carefully, I should say that if I understand the distinction I think you're drawing, I think I'm doing both at the same time: every "node" has the full address for its context with it. But the outline structure is like a linked list, sort of. Seth > A linked list where every "node" has the context fully specified. And > the fact there's only one "tree structure value" per record (the > parent key) keeps things simple, with everything in a simple, flat > denormalized data structure that's as fast to work with as > conceivable, as well as massively scalable -- perfectly amenable for > NoSQL backends, for instance. > > That flat structure lets you extend the basic concept of db relations > to what I call a context (so it has all the functions you need > regardless of specific context, rather than being simply joins of two > tables representing particular entities in the real world). > > > Seth -- You received this message because you are subscribed to the Google Groups "leo-editor" 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/leo-editor?hl=en.
