2013/9/9 Mark Engelberg <mark.engelb...@gmail.com>: > OK, I'm starting to understand the shape of the data better. However, you > say, "the ability to arbitrarily look into any node on the tree and then > walk up it getting all of the parents until root." What does the query for > this look like and specifically what information do you want returned? What > I'm getting at is, are you only querying by name (e.g. "theta") and hoping > to get all the paths down to all the nodes with a name of "theta", or do you > have some other way of distinguishing between the two theta nodes in the > tree, and you only want the path for one of them? If the latter, how are > you uniquely identifying the nodes? > > Is there any other information you need to access than the the upward path > from a node to the root?
This is quite an interesting post, with the underlying question in my mind : where to put the line between pure datastructure manipulation with clojure.core only, and a datalog (datomic)/sql engine ? -- -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en --- You received this message because you are subscribed to the Google Groups "Clojure" group. To unsubscribe from this group and stop receiving emails from it, send an email to clojure+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
