Types and "join compatibility"
From: André Nęss <andre.naess_at_gmail.com>
Date: 30 Jul 2005 10:24:24 -0700
Message-ID: <1122744264.923970.145560_at_f14g2000cwb.googlegroups.com>
I've recently been playing around with a tiny implementation of the relational algebra based on the description in Date's "an Introduction to database systems" (7th. ed.).
Date: 30 Jul 2005 10:24:24 -0700
Message-ID: <1122744264.923970.145560_at_f14g2000cwb.googlegroups.com>
I've recently been playing around with a tiny implementation of the relational algebra based on the description in Date's "an Introduction to database systems" (7th. ed.).
I'm interesting in both theoretical considerations as well as practical experiences. Does there exist any (prototype) implementations of the relational algebra coupled with a fairly powerful type system?
If someone can provide straight answers that would be great, but I'm also very interested in pointers to material I might study to understand this in more detail. If something similar has been discussed here before (I'm sure it has) I would be very interesting in reading those threads. As I mentioned, except for an article about using a union type as the attribute type I've not been able to find any threads that cover this. Received on Sat Jul 30 2005 - 19:24:24 CEST