My current research leads me to the problem of analysis the dependency
between 2 database query.
For example: There is an UPDATE query and then a SELECT query.
My system have to automatically detect whether the SELECT query result

With a few hours of theory under my belt, I'd like to ask if there's
ever a time that you don't want a completely normalized dB, that is, a
normalized database being a dB that has no redundant information (my
understanding of what a normalized database is).

---------------
Glossary 0.1.3               "You keep using that word.
                              I do not  think it means
january 2008                  what you think it means"

What's the simplest way to set up a relationional database with tree
data? I'm more interested in simplicity vs speed.
Suppose you have a tree database with 3 levels. Company-Division-
Manager. Like this:

A new buzzword seems to have crept up on me when I wasn't looking --
I'm seeing a lot about "master data management" (http://
en.wikipedia.org/wiki/Master_Data_Management) as somehow a different
(or more specialized?) discipline than plain 'ole "data management".

I've been trying to figure out how to use relational algebra to
extract some data from the following relation:
<Year, Name, Votes> where the primary key is Year+Name (composite
key). A sample table could contain the following entries:

On the last years, I have been putting some modest but consistent
effort to build a computing model whose principles, I embodied under
the form of a db core that allows relation definition and manipulation
as well as basic relational operations.

I was wondering what your current stances towards the principle of
current design is cdt - info about the POOD is actually pretty sparse
on google, which has not helped my own understanding. I gather that
Date has realigned his opinion - although what to I know not - and

I'm currently evaluating whether a relation is in 2NF. The relation is
defined as follows:
<Year | Winner Name | Winner Votes | Party | Home State> in the
context of an election. I've given a sample relation below.

The following is a technical report on a data modeling project
that was recently assigned to me by my professor. I post it
so that anyone else who is studying databases and data modeling
can have an example to go by with their study of databases.

Marshall wrote:

Marty:
A few months ago you and Andrew Ross were kicking around a correction to the
way tups_per_page is calculated for the iitables view.  Did you ever get
that working properly?   And did you test it to see what happens if you

AFAIK the conventional wisdom is that no absolute definition of atomic
exists for domain types.  Throwing caution to the wind, in this post I
wish to conjecture a definition of atomic that, perhaps with some more
effort at its formalisation, can provide some absolute meaning for a

I just had this idea about possreps.
In another context, someone discussing methods, or functions
that are bound very closely to a specific type, commented
that he thought that such functions should be extremely