On Dec 4, 2005, at 6:51 PM, Kevin Toppenberg wrote:
Now, at this point, it would be easy to fall into a relational- database bashing party. But I would like comments on WHY (from a technology point of view) is it intrinsically slower? Bhaskar made a comment once that he suspected that relational database might be using b-trees in the background to increase speed, while still presenting a flat table to the user. I wonder if that is true, or if it would be possible.
I should add that the technology used "under the hood" has nothing whatsoever to do with the relational model. Any reasonable implementation would make use of B-trees, hash tables, or some such, but the relational model has entirely to do with the logical model presented to the user. How the data is physically stored on disk, how it is updated, etc. has nothing to do with the relational model. Now, it is true that a logical model (or a typical usage pattern) may influence the choice of physical representation or algorithms used, but that is all entirely up to the implementor.
=== Gregory Woodhouse [EMAIL PROTECTED] "The most profound technologies are those that disappear." --Mark Weiser ------------------------------------------------------- This SF.net email is sponsored by: Splunk Inc. Do you grep through log files for problems? Stop! Download the new AJAX search engine that makes searching your log files as easy as surfing the web. DOWNLOAD SPLUNK! http://ads.osdn.com/?ad_id=7637&alloc_id=16865&op=click _______________________________________________ Hardhats-members mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/hardhats-members
