| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: Concurrency in an RDB
On Dec 25, 4:54 pm, "David" <davi..._at_iinet.net.au> wrote:
> 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.
You're assuming a specific implementation, which is not a valid assumption. A relational and a non-relational approach might use the same implementation and have the same performance.
Marshall Received on Sun Dec 31 2006 - 13:09:43 CST
![]() |
![]() |