Re: Other tree representations in SQL

Alfredo Novoa wrote:
> > The process of visiting all nodes is "traversal" without "ns".
>
> What is "ns"?

The two letters too many that you are using every time when you are trying to spell "traversal".

> > Since your solution is not a Tree, because it does not differentiate
> > between preceding and subsequent nodes, it can not be traversed.
>
> Preceding and subsequent?
>
> Show me a tree definition containing that words.

http://www.nist.gov/dads/HTML/tree.html

"It is rooted and ordered unless otherwise specified."

Your tree is not ordered.

> My example is a relational representation of a simple hierarchy.

Yes, but it's not a tree.

> > "Tree {N}" does nothing at all.
>
> Of course it does someting. It returns the set of all the nodes, and
> the user can transverse the set in all of the ways he wants.

Prove it!

How would I simply print out every "N Char"?

Kind regards,
Carl

--
Carl Rosenberger
db4o - database for objects - http://www.db4o.com