--CELKO-- wrote:
>>> Although inorder traversal of a (non binary) tree is possible
>>> (you
> only have
> to specify what are "left" and "right" subtrees), in this post I'm
> gonna talk about postorder... <<
>
> I have not had time to research the generalizations of inorder
> traversals; I think Knuth had one definition. But it does not
> look like a good approach for building a tree in SQL because we
> are mostly interested in aggregation up and down the tree for
> reports in SQL. You can find a single node without using a
> traversal by using the key for that node in SQL.
Joe:
In my attempts to develop a relatively simple database I have
followed the following path:
- Attempt the develop a spreadsheet-like DB in MS Access.
- Realize that Access is not a spreadsheet.
- Find out that: There is such a beast as DB theory.
- Read a book allegedly about database theory.
- Find out about something called normalisation.
- Buy a book or two by Date et. al.
- Buy and learn K & R.
- FINALLY learn that I know NOTHING about fundamentals and buy
Knuth:
- Where I am now, Chapter 1, trying to relearn induction.
So
Were you to give a beginner a bit of a hint, would you suggest
that: If they were considering real DB development they should
start with Knuth?
JE
Received on Wed Dec 04 2002 - 22:49:37 CST
