Re: Concurrency in an RDB

paul c wrote:
> David wrote:
> ...
> > Despite the logical purity there are disadvantages to be considered.
> > Modern CPUs are quite adept at manipulating strings in the normal
> > representation. The space and time overheads of your suggestion are
> > significant.
> > ...
>
> Actually relatively less adept than they used to be, ie., the
> instruction sets have stagnated for decades and when applied to a
> sequential string incur all kinds of cache misses on the latest cpu's
> which are so much faster than the memory they use, ie., they don't come
> close to the advertised cpu speed.

Nevertheless I wouldn't be surprised if the string manipulation is 100 times slower with the relational approach. Each step through a head-tail list would typically involve an independent search through a BTree.

David Received on Tue Dec 26 2006 - 01:54:55 CET