Re: double linked list

>> [book on TREES & HIERARCHIES IN SQL] Are we rediscovering the past?
Network model databases have their place and can out perform a RDBMS in those cases. It's just that those cases are few and far between. In my experience, it's when the data is static, ie, load data once and read many times very fast. Dynamic data just bogs done on link updates. <<

Actually, I spend most of the time showing how to code hierarchies without using links, but by taking a set-oriented approach, like the one I just did a "cut & paste" on.

Actually, the old network and IMS databases are really fast to load and access. They just have no flexibility. It's like a Polar Bear -- great in one environment and no place else.

If you put parts subordinate to their suppliers, and want to get all the sources for a "Metric #5 Machine Screw", you will be chasing pointer chains from the supplier, thru his catalog, back to the next supplier, thru his catalog, etc. Received on Sun Feb 09 2003 - 20:08:47 CST