| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: MV counterexample
"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.
-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
![]() |
![]() |