On Fri, Dec 30, 2011 at 9:41 AM, Seth Johnson <[email protected]> wrote:
This is a nodes table, two columns/fields: > Node key - Parent key > A - N > B - N > C - N > D - X > E - X > N - D > N - E This is the tree represented by the above records: > X - D - N - A > \ B > \ C > \ E - N - A > \ B > \ C (eom) > To find all children of node N, seek N in an index on the parent key > field. Skip through until it doesn't match. > > Node key - Parent key > A - N > B - N > C - N > > > To find all parents of node N, seek N in an index on the node key > field. Skip through (reading the parent key field) until it doesn't > match. > > Node key - Parent key > N - D > N - E > > > Seems to work . . . > > > 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.
