On Fri, Dec 30, 2011 at 3:25 PM, Seth Johnson <[email protected]> wrote:
> On Thu, Dec 29, 2011 at 6:37 PM, Ville M. Vainio <[email protected]> wrote: >> >> Given the list of edges (a,b) : >> >> If you want all children of node N, list edges where N is the 'a' >> node, and store the 'b' node from every edge. To find parent(s) of N, >> list edges where N is the 'b' node. > > > One can use two indexes instead of having an edges entity: > > To find all children of node N, seek N in an index on the parent key > field. Skip through until it doesn't match. This doesn't work if N is cloned somewhere, i.e. N has several parents. -- 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.
