Re: Implementing trees in a relational database
From: Michael Dorfman <Michael_Junk_at_hotmail.com>
Date: 1 Aug 2002 02:21:49 -0700
Message-ID: <aaca6777.0208010121.2afdb832_at_posting.google.com>
Date: 1 Aug 2002 02:21:49 -0700
Message-ID: <aaca6777.0208010121.2afdb832_at_posting.google.com>
71062.1056_at_compuserve.com (--CELKO--) wrote in message news:<c0d87ec0.0207301718.6427edd7_at_posting.google.com>...
> >> ... the paper on this at SIGMOD/PODS by Cohen, Kaplan and Milo
> titles "Labeling Dynamic XML trees"
>
> http://www.informatik.uni-trier.de/~ley/db/conf/pods/pods02.html#CohenKM02
>
> It tries to come up with numbering schemes for trees that change a
> lot, because that is the weak spot of the numberting scheme. <<
>
> I just let my ACM membership lapse! Oh well, maybe I can find a copy
> somewhere.
>
Here you go-- it's in PostScript at:
www.research.att.com/~edith/Papers/pods02-proceedings.ps
Michael Dorfman Received on Thu Aug 01 2002 - 11:21:49 CEST