Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> completeness of the relational lattice

completeness of the relational lattice

From: Jan Hidders <hidders_at_gmail.com>
Date: Fri, 22 Jun 2007 09:06:28 -0000
Message-ID: <1182503188.704386.314750@n60g2000hse.googlegroups.com>


Hello Vadim, Marshall and others,

The discussion seems to warrant it's own thread, so here goes.

There seems to be some disagreement on what algebra we are studying. So let's discuss this first. It is important this get's fixed, because otherwise any time I spent on proving things might be lost. I think it's also important that we settle on notation, because I noticed I was getting confused. Since it's bascially Vadim's idea I'll try to stick to his notation as much as possible.

So the syntax of the algebra is as follows: (E is the non-terminal for algebra expressions)
- R : a relation name

I don't like having 10 and 11 because it clearly steps outside the relational model and first order logic, but I see no direct reasons to remove them. There was some doubt on the presence of [x] but I don't see how we can otherwise define projection. Also I don't see how we can avoid mentioning attributes since we already have 'x=y' where the are already mentioned.

So can we agree on this algebra and notation?

Received on Fri Jun 22 2007 - 04:06:28 CDT

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US