couchdb-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Adam Wolff <>
Subject Re: DAGs (directed acyclic graphs) in couchdb
Date Mon, 13 Jul 2009 14:55:34 GMT
There didn't turn out to be a good solution, that I found at least. In our
app, we're just storing a reference to the root node and putting the DAG
together on the client side.

On Mon, Jul 13, 2009 at 6:51 AM, Jason Sachs <> wrote:

> This thread (
> )
> mentioned directed acyclic graphs briefly... but if there was a moment
> of enlightenment on good ways to represent DAGs in couchdb, I must
> have missed it. Any thoughts? I've read the hierarchy page on the wiki
> ( but it
> requires each node to store its materialized path. DAGs don't have a
> single unique path to nodes, and even if you tweaked this design to
> list the multiple paths to a node from the root (or from a designated
> root, since a DAG doesn't really have the concept of a root, and can
> have multiple roots), you still have the possibility of combinatorial
> explosions of data.

  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message