Alexander Bokovoy wrote: > This does not means that referential integrity is the only way to solve > this task.
I explicitly said it'd be an add-on, strengthening facility. > For example, I would like to see our tree-like structure better > modelled using nested sets instead of adjacency model. This is covered in > old DBMS Magazine's article (circa '96) a link to which I can't find > now but have one for its new edition: > > http://www.intelligententerprise.com/001020/celko1_1.shtml I see this more as an implementation detail. > this will make tree management much more easier for all components, but it > is hard to put it into refint way for in-table relations between objects > which we have almost everywhere and which are in great interest because > orphaned branches harder to find than orphaned links to different kind of > objects. And this is better, because? You win some performance, you loose the ability to use the refint checking. Where refint checking would shift some of the burden to the database engine, which will have the data local and is highly optimized for these kind of things. I know about the nested sets vs adjecency. All that does is prove your point that SQL databases are not ideal for storing graphs. Emile --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
