Re: On formal HAS-A definition
Date: Wed, 12 May 2010 11:54:35 -0700 (PDT)
Message-ID: <e50c99e6-03ef-417e-8701-d8e221319045_at_r34g2000yqj.googlegroups.com>
On 12 mei, 18:12, Tegiri Nenashi <tegirinena..._at_gmail.com> wrote:
> On May 12, 4:31 am, Erwin <e.sm..._at_myonline.be> wrote:
>
> > See for example "Applied
> > mathematics for database professionals", which builds on the work from
> > the authors' tutor, Bert De Brock.
>
> Page#, please?
Eurhm, page 1 to 330, I would say. The book consistently references the empty relation as FI (you know, the circle with the "forward slash" intersecting it), untyped.
> In foreword Date & Darwen say that there is only one
> empty relation (when ignoring types). This indicates that by "empty
> relation" they meant something else, I suspect R00 (aka DUM). I
> thought standard definition for an empty relation requires it to have
> empty set of tuples only (with no constraint on the header).
> > There is another view of relations in that a relation does not 'have'
> > a heading as such.
>
> So how exactly is it done for an empty relation? There is no tuples!
I don't know. It is not my preferred point of view either. I suspect proponents of this point of view would address this problem by saying that the empty relation does not have any particular heading/type. Once again, I suspect whether one can get away with that position depends on the intended goal to achieve. Received on Wed May 12 2010 - 20:54:35 CEST