Sanity check - BinaryLink searches

[Ruslan Zasukhin]

On 12/13/05 4:26 PM, "Ed Kleban" <Ed at Kleban.com> wrote:

> "A stable sort is one that preserves the relative order of items with equal
> keys. Suppose that you sort an array of objects first on one property, then
> on a second.  A stable sort will preserve the first sort order when it
> performs the second."
> 
> In this context, the records of a table are inherently first sorted by order
> of links added to the Links table.

I afraid you think to hard here.

    you have LEFT recid 1 which is linked to recids from RIGHT 3, 5, 7, 9

Point. 

So you have 

    1 linked to { 3, 5, 7, 9 }

NEVER mind order of adding records into RIGHT TABLE.
NEVER mind order of links establishing.

You always have 

    1 linked to { 3, 5, 7, 9 }


-- 
Best regards,

Ruslan Zasukhin
VP Engineering and New Technology
Paradigma Software, Inc

Valentina - Joining Worlds of Information
http://www.paradigmasoft.com

[I feel the need: the need for speed]