Dear fellow programmers,
The problem with an in memory database which you want in case of
2 tier applications is that you dont know where to start inserting or
deleting records in the actual (server)  database. Thats why you might

I just finished reading one of Ralph Kimball's books.  In it he
mentions something called a cyclical redundancy checksum (crc)
function.  A crc function is a hash function that generates a checksum.
I am wondering a few things.  A crc function would be extremely useful

C.J. Date in a recent text defines BCNF in terms of superkey.
... every nontrivial FD A -> B satisfied by R, A is a superkey for R.
Previously he (and others) defined it where A had to be a candidate key
(which is irreducible).

Ok, I am looking at this question about b+ trees and I just don't get
it. Here is the question:
A given B+-tree is stored on a disk with blocks containing 512 bytes
each. The indexed key, data pointer and pointer to a sub-tree occupy 8

I've got a table [User] with which is related to [Character] by 2
relationships. Now, Access seems to be complaining about this and is
displaying the table twice with different aliases in the Relationship
view..

I know that visual basic, lisp, python, c  , c++ , perl, all have 2
value logic.  What makes SQL so special that it needs 3vl when all
these langauges make do with 2vl?

This is an offshoot of the discussion of Idempotence and "Replication
Sensitivity".  I prefer to start a new discussion, because the thread drift
is too great.
Extending the concept of binary NOR so that is can operate on a column of

Sorry for my bad english.
I want to add a child(Tom) to Chuck but not on the left of DONNA but
on the right of FRED.
Can You help me ?

Faced with a data collection something like:
Tom is aged 20, Dick is aged 30 and Harry is aged 40
I find it apt to view a relation predicate for them as:
"There is a people_relationship where name is X and age is Y"

Some, but not all, of you will find this new IDC paper entitled
"Because Not All Data is Flat: IBM's U2 Extended Relational DBMSs" to
be of interest.
Other than the fact that the term "flat" is used, which I know can be

If f(x) =   SELECT * FROM x GROUP BY *
then I would expect f(x) = x provided that x is a relational table.  In
other words,  I expect that projecting a relation into (or it it onto?)  its
own space is an idempotent operation.

It has always seemed to me that nothing looks more obviously and intuitively
wrong than a table that is in third normal form (3NF) but not also 4NF.
Furthermore I rarely see violations of 4NF "in the wild" in databases
intended to support core business transaction processing (as ...

I am working on an assignment which has 2 ternary relationship. I'm
can't figure out their cardinality.
Maybe I am going through one of those mental blocks...
Can someone give me some cardinality examples for N-ary relationships?

I 'd like to repropose my original problem which got lost among vain
fights
and pollution.
I am infact trying to write as an exercise a "reporting" program. Or

Given a relation schema R {A, B, C}, where A and B are each candidate keys.
If the current extension is
r  {{A:1, B:9, C:3}
   {A:2, B:8, C:4}}