Re: On Formal IS-A definition
From: Tegiri Nenashi <tegirinenashi_at_gmail.com>
Date: Wed, 5 May 2010 13:56:35 -0700 (PDT)
Message-ID: <65c26192-cfdf-4615-8eb7-4b50ba64b590_at_h37g2000pra.googlegroups.com>
Date: Wed, 5 May 2010 13:56:35 -0700 (PDT)
Message-ID: <65c26192-cfdf-4615-8eb7-4b50ba64b590_at_h37g2000pra.googlegroups.com>
On May 5, 12:41 pm, Erwin <e.sm..._at_myonline.be> wrote:
> ... Not in the same sense that relation algebra prevents
> graph databases because relation algebra does not understand graphs.
This is very imprecise statement. I'll embark upon your typo and suggest that relation algebra (http://en.wikipedia.org/wiki/ Relation_algebra) does exactly that. It manipulates binary relations that are essentially adjacency matrices representing direct acyclic graphs. Received on Wed May 05 2010 - 22:56:35 CEST