Binary links Re: Question Backlog for Valentina mailing list.

[Ruslan Zasukhin]

On 11/16/05 11:25 PM, "Ed Kleban" <Ed at Kleban.com> wrote:

> So in retrospect, I've been making this more complicated than it really is.
> A binary link is simply a table of ordered pairs of recIds where both sides
> are indexed.  Thus it is equally efficient to find all the children of a
> parent or ... what may in fact be multiple parents of a child.  That's why
> even though I keep using the terms "1->M" and "M->1" you keep typing in
> reply "M->M".  The binary link is inherently a "M->M" relationship and use
> of it as "M->1", "1->M", or "1->" are simply special usage side cases.  The
> reason you want the user to supply whether a given side is "one" or 'Many"
> is so that you know whether you can stop your search or processing of an
> index after you find the first occurrence, or whether you need to look for
> more.

Right, additional info is

    additional constraints
    additional possible improvements

-- 
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]