Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Re: Reinventing the TransRelational Model?

Re: Reinventing the TransRelational Model?

From: x <x_at_not-exists.org>
Date: Thu, 13 Apr 2006 15:36:21 +0300
Message-ID: <e1lgj5$9as$1@emma.aioe.org>


"paul c" <toledobythesea_at_oohay.ac> wrote in message news:COg%f.6890$7a.3032_at_pd7tw1no...

> Yes, it was the Universal Btree that I was thinking of. When I looked
> at it, it didn't make much sense for my purpose which was memory-based.
> Like the ctree, it also depends on a fair amount of cpu horsepower as
> well as being a 'two-stage search' (my words). However, I was impressed
> by it, very elegant and it seems that Bayer's imaginative powers haven't
> been dimished.

For an ilustration of a new (2001) state of the art sorting algorithm see http://www.cs.auckland.ac.nz/~jaru003/bead_sort.gif :-)

http://en.wikipedia.org/wiki/Bead_Sort
I don't know if is patented. Received on Thu Apr 13 2006 - 07:36:21 CDT

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US