Results 1 to 2 of 2
  1. #1
    Join Date
    Mar 2003
    Posts
    1

    Relational Algebra Trees

    Relational algebra Trees, i have converted my sql to relational algebra. does anyone know how to make it into a tree?
    Tryin to understand these things, does anyone know anything about them?

    UNION Table1 AND Table2 OVER code giving T1
    RESTRICT T1 where code = NULL giving T2
    PROJECT T2 OVER Table1


    Thanks

  2. #2
    Join Date
    May 2002
    Location
    Florida, USA
    Posts
    49
    Hmm... I have been playing with relational algebra, while reading C.J. Date's Introduction to Database Systems and Foundation for Future Database Systems. At the moment I don't remember how trees are implemented in a truly relational language, but apparently they are much better implemented in relational algebra than in the typical SQL "CONNECT BY".

    You might try either of those books, or see if you can find some info on Fabian Pascal's Database Debunkings

    See this discussion from Pascal's site: http://www.dbdebunk.com/fp3a2.htm

    When I have the time, I might look that syntax up and get back to you .

    (One note: the "pure" relational algebra people say NULLs are a bad idea. And, in true formal logic, a NULL is unknown, thus you can't test it for equality with anything; you can only test if something IS or IS NOT NULL)

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •