Re: MV counterexample
From: x <x-false_at_yahoo.com>
Date: Thu, 6 May 2004 17:53:20 +0300
Message-ID: <409a50a1$1_at_post.usenet.com>
Date: Thu, 6 May 2004 17:53:20 +0300
Message-ID: <409a50a1$1_at_post.usenet.com>
- Post for FREE via your newsreader at post.usenet.com ****
"Laconic2" <laconic2_at_comcast.net> wrote in message
news:C-qdnf_mH5pR2wfdRVn-sA_at_comcast.com...
> This is off topic, but anyway:
>
> You mentioned "di-graphs". In the original Codd article,
> he compares the data model he is proposing to the "graph and network
models"
> . I'm assuming that di-graph and graph boil down to the same thing. Is
> that so? Or is there something more I need to learn about di-graphs?
di-graph = directed graph, a graph with one way edges.
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
- Usenet.com - The #1 Usenet Newsgroup Service on The Planet! *** http://www.usenet.com Unlimited Download - 19 Seperate Servers - 90,000 groups - Uncensored -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=