Re: Logical equivalence of simple and complex types under the relational model?

Rene de Visser wrote:

> "Tom Hester" <thester_at_metadata.com> wrote in message
> news:f2f74$41abb8de$45033832$19131_at_msgid.meganewsservers.com...
>
> I have not seen this interpretation of RM. Do you have a reference? I aways
> think of RM as tuples over well formed logical expressions, and then
> consider the logical system (in the formal sense) generated.
>
>
> Rene.
>
This is a common conceptualization of relational databases in what used to be called the field of "logic databsaes". There are many books on the subject in the mid-80's and several contemporary introductions to finite model theory discuss the notion. Model theory treats a language as a syntax, the rules of the language (query language if you prefer) and an interpretation of the language into a model (a data model if you prefer). I did a search on "model theory database" in Goggle and got lots of hits. For a simple intro see:
http://isrc.massey.ac.nz/finite_model_theory.html . Received on Tue Nov 30 2004 - 16:42:22 CET