[gclist] Garbage collection and XML

[Ji-Yong D. Chung]

    Hi,

> [David Chase wrote]

> It's also possible, again if you are a loon, and not in
> Java, to create applicative speculatively updated data
> structures -- there, you reallocate a spine to "modify"
> (say for a red-black tree) and attempt to compare-and-swap
> in the new root.

    This is a side issue, but is it possible to apply locks on subnodes,
and rather than the root?  If one locks a node, then,
sibling nodes should be accessible to multiple threads.

    Also, is it possible to apply  shared locks (read locks, intent-read
locks),
 that is locking concepts, available from database?
Or are these types of locks too expensive?

    Just being curious.