| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: Does Codd's view of a relational database differ from that ofDate&Darwin?[M.Gittens]
Jon Heggland wrote:
> In article <I4Cxe.135796$Bh7.7066690_at_phobos.telenet-ops.be>,
> jan.hidders_at_REMOVETHIS.pandora.be says...
>
>>>I did not ask for query languages, I asked for operators. >> >>Why would you need them?
I see. At the moment I don't think there is really such an algebra for the data models we are talking about. I know there have been a few attempts, but none that I would really call *the* algebra. Whether such an algebra can be designed and what it would have to look like is actually quite an interesting research question (even if you only consider ER models only as an interesting layer on top of the RM).
>>>As I asked earlier: If we renamed the RM terms to match, would it then >>>be an ER-like model? >> >>The anwers is still no.
Er, no. It is *a* difference, I'm not sure if I would call it *the* difference.
> I also note that Halpin takes great pains to distinguish ORM from ER---
> to the point of apologising for "bashing" ER.
Oh, yes, and ORM *is* better, yet if you use these techniques the models will often look the same.
>>>Not personally, but what more do you need than definitions of value, >>>domain, tuple and relation, and a minimal set of algebra operators? >> >>The notions of database schema, database constraints, database instances >>and how they are exactly related.
My estimate would be that it is comparable, where FDM-like models are probably a bit simpeler.
![]() |
![]() |