| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: Newbie question about db normalization theory: redundant keys OK?
"David Portas" <REMOVE_BEFORE_REPLYING_dportas_at_acm.org> wrote in message news:1065f96a-1f8e-4fc7-b1cc-53137ebd8b8f_at_s8g2000prg.googlegroups.com...
> On 14 Dec, 17:51, "Tony Rogerson" <tonyroger..._at_torver.net> wrote:
> > You are saying that this is a distributed database but that it lacks a > mechanism for accurately propagating changes out to all its nodes? > Well in my view such a DBMS would be broken. It surely violates Codd's > principle of "Distribution Independence". Let's follow your example to > its conclusion though. The solution is to replace whatever copy of the > Blah relation exists in the application with the new Blah relation > that superceded it. Now all emails reach the correct address and there > is no problem that requires a different key. >
Forgive me for butting in, David, but where did you come up with the idea that it is a distributed database? What have disconnected applications--that is, applications that use something akin to disconnected ADO recordsets or ADO.NET datasets--to do with distributed databases?
The question is: for how long is the data that was just read out of the database considered to be valid? Until the next update? Or is it stale as soon as its read? Does it have something to do with transaction control or locking? If several updates occur between the reading of one piece of information and the reading of another, how can you be sure that any answer that involves both pieces of information is correct? How can you be sure that you haven't read the same information twice? If you use an artificial key and a timestamp (or rowversion), then there can be no doubt as to whether or not the information in question changed between the first reading and the second.
> -- > David Portas > > >Received on Fri Dec 14 2007 - 23:17:09 CST
![]() |
![]() |