M:N relation. So how do we implement this ?
2. A > B
B > C
C > A
Let each of the above relations be 1:N. This is a Cyclic Relation. How do we handle
this
situation ?
Regards,
Arijit
Bruce Snyder wrote:
> This one time, at band camp, Arijit Ghosh said:
s. Do you expect any problems here? Denis.
- Original Message -
From:
Arijit Ghosh
To: [EMAIL PROTECTED]
Sent: Thursday, December 05, 2002
7:10 AM
Subject: Re: [castor-dev] Lazy loading
with long transaction
Hi Denis,
With respect to bi-directional 1:N relationship, did you eve
ing a stored procedure". Even though
the latter is
the fastest, implementing that would bypass castor. Does it make a general solution ?
Waiting for your feedback.
Regards,
Arijit
Bruce Snyder wrote:
> This one time, at band camp, Arijit Ghosh said:
>
> AG> Why
error: org.exolab.castor.jdo.LockNotGrantedException:
persist.deadlock
Successfully updated Doc5 (506)
Regards,
Arijit
Bruce Snyder wrote:
> This one time, at band camp, Arijit Ghosh said:
>
> AG>My heartiest CONGRATULATIONS to both you and your wife!!
>
> Th
Hi,
Just wondering -- Castor being used in the Persistence layer, should
be able to handle the elementary Deadlock problems.
As mentioned in the other posting, Concurrent access of Department by
2 or more Doctors belonging to the same Department, leads to Deadlock.
But isn't this is a c
