At 10:23 19.11.2000 -0800, you wrote:
>Ok, here is where I come from, I was reading (a month ago) "Safe Locking
>Policies for Dynamic Databases" by Vinay Chaudri and Vassos Hadzilacos (JCSS
>1998) where they generalize the serializability proof to "insertion and
>deletion of entities" and discuss 3 types of implementations for distributed
>dynamic environments (READ AN EJB CONTAINER :)))).  Skip the theorem on
>canonical schedules, frankly I couldn't walk through it without blowing a
>fuse, but the 3 policies are very interesting (Dynamic Directed Acyclic
>Graph, Altruistic Locking, Dynamic Tree Policy).  The paper is public and
>you can find it. I got it from MIT :)

To save anyone interested the search:
http://citeseer.nj.nec.com/papers/cs/11439/ftp:%23@S@%23%23@S@%23ftp.cs.toro
nto.edu%23@S@%23pub%23@S@%23kbms%23@S@%23proofs.pdf

If that monster url isn't working for you (it seems they cache this stuff),
try: http://citeseer.nj.nec.com/chaudhri95safe.html

.. and click PS | PDF | Image on the upper right corner.

-- Juha



Reply via email to