| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: RM and abstract syntax trees
"paul c" <toledobythesea_at_ooyah.ac> wrote in message
news:ba8_i.205644$th2.103703_at_pd7urf3no...
> David Cressey wrote:
> ...
> >> I already gave an example of a dereference operation. Syntactically is
> >> is just a SQL SELECT statement, but semantically I claim it opereates
> >> just like a wordy dereference. The point is not whether Relational
> >> algebra has an explicit dereference operator. The point is can
> >> something be set up to operate like a pointer.
> >
> > If your point is that pointers can be simulated inside a relational
system,
> > then I agree.
> > Where I disagreed with David BL was whether the data item (OID) that is
> > used to stand for a pointer really is a pointer.
> >
> >> <side note>
> >> The reason I make a fuss about this is the abuse of these surrogate
> >> keys in production applications. There are times when surrogates are
> >> necessary, but too often rather than doing real data modelling,
> >> developers slap on a surrogate, call it the primary key, and conclude
> >> their database is normalized.
> >> <end side note>
> >>
> >
> > Agreed, strongly.
> >
> >
>
>
This is a good comment to close the subthread about pointers.
Now maybe we can get back to RM and abstract syntax trees, the main topic
of discussion.
Is there anything about syntax parsing that makes the RM an awkward tool for
modeling it?
Received on Tue Nov 13 2007 - 06:26:39 CST
![]() |
![]() |