Re: pointers on representing tree in db?

In article <9bqo1s$6gk$1_at_bob.news.rcn.net>, Steve Long says...
>
>keep in mind "space vs time". the more efficient the storage, the more
>processing required to retrieve data. "walking the tree" will be very
>process intensive with such a simple representation.

Agreed, luckily my buisness doesnt require "walks" in the tree. The basic needs are typically: gimmie the children of the current node, search the current nodes subtree for nodes that matches condition... and track a node back to another node.

[...]
>
>a programmer finds writing code easier than designing good structures. a
>data modeler finds designing good structures easier than writing good
>algorithms. as we are in a "space is cheap and so is processing", i suggest
>response time is the critical factor, which implies effiecient processing
>should take precendence over conserving space...
>
>the upshot is to consider using a more complex storage structure which will
>reduce the processing time to locate a node or nodes.
>
> [...]

/Lennart Received on Sat Apr 21 2001 - 10:46:57 CEST