| Oracle FAQ | Your Portal to the Oracle Knowledge Grid | |
Home -> Community -> Usenet -> comp.databases.theory -> Re: A neutral challenge.
"Isaac Blank" <izblank_at_yahoo.com> wrote in message
news:NIYLa.149$6N1.23088370_at_newssvr21.news.prodigy.com...
> "Bob Badour" <bbadour_at_golden.net> wrote in message
> news:cd3b3cf.0306280919.7a6ab963_at_posting.google.com...
> > "Isaac Blank" <izblank_at_yahoo.com> wrote in message
> news:<HSZKa.761$Ks2.68590664_at_newssvr15.news.prodigy.com>...
> > > "Bob Badour" <bbadour_at_golden.net> wrote in message
> > > news:UYLKa.588$Sp2.78550140_at_mantis.golden.net...
> > > > "Peter Koch Larsen" <pkl_at_mailme.dk> wrote in message
> > > > news:61c84197.0306261140.6454f73c_at_posting.google.com...
>
Another scheduling application would impose a different domain constraint.
> Also, imposing this limitation would probably make the database design
> and code more complex than it should be.
I disagree. I see no reason to believe it would have any effect on complexity; although, it would certainly have an effect on integrity.
> I can easily come up with a simple
> and fast database design using native SQL types for timestamps, but
> enforcing the granularity by means of appropriate database schema and
> constarints will be a little bit challenging.
I suggest this reveals a flaw (or flaws) in SQL. The schedule granularity is simply a domain constraint. Received on Mon Jun 30 2003 - 11:47:06 CDT
![]() |
![]() |