Re: Updatable views
Date: Tue, 13 Dec 2005 09:56:16 +0200
Message-ID: <dnlur4$v3l$1_at_domitilla.aioe.org>
"Rick Elbers" <rick.elbers_at_chello.nl> wrote in message
news:hrsrp1h6gp2js2loq84boie5dt4svcec9b_at_4ax.com...
> On Mon, 12 Dec 2005 11:24:25 +0200, "x" <x_at_not-exists.org> wrote:
>
> Dear x,
>
> I am just a beginner in database theory. I consider myself not much
> of a beginner in objects or responsibilities.
> The problem seems real
> simple, from your answers I gather for most database experts this
> problem is not simple.
Don't you think that there must be a reason why this problem is solved by
humans case by case ?
Too bad you asked. Now you know it can't be done :-) Another chance lost
for solving this problem.
> >"Rick Elbers" <rick.elbers_at_chello.nl> wrote in message
> >news:qbiep11f3eg8h1mmkqhqskc77ai1r7boq7_at_4ax.com...
> >> Probably in vain but I will give you answers.
> >>
> >> On Wed, 7 Dec 2005 11:08:57 +0200, "x" <x_at_not-exists.org> wrote:
> >>
> >
> >Define what is a "view" for your application.
> Every join you can make. More simple even: every information set.
Well, for a set with n elements, there are 2^n subsets. What do you mean by every information set ? Don't answer that :-)
> >Define what is an atomic update for your "view".
> Every update you can think off
The problem is if your algorithm can guess all the updates I can think off. :-)
> >Define the types of constraints you want to handle.
> All
How do you deal with constraints that cannot be defined by an algorithm ?
:-)
How do you deal with procedural code ?
Good luck ! Received on Tue Dec 13 2005 - 08:56:16 CET