Re: Filesystem structure question

> With the current scheme, the version tree of a node is indexed. You
> can find whole branches, tips, branchpoints, etc. with a single
> query into the "nodes" table.

Sure, but what needs to do this?

> With your scheme, all that information would have to be storead
> explicitly in the tables with pointers between nodes. We'd have to
> maintain the version tree by hand, opening a door for consistency
> problems.

Why would that information have to be stored with pointers between
nodes, and why would we have to maintain the version tree by hand?
What consistency problems would exist which don't exist in the current
model?

> It would also slow down certain kinds of operations, like branching.

I don't think so. Branching in our model is very simple, with or
without "nodes". You just make a new directory entry pointing to the
node-revision you're branching from. You don't even have to recurse.
Received on Sat Oct 21 14:36:16 2006