At 02:12 AM 3/23/2004, Claude wrote:
>Is walking bottom-up through a subtree deleting each leaf entry the
>best way to delete the entire subtree?
Well, by "walking bottom-up", I assume you mean using one-level
searches to walk down and then delete entries on the way up.
A better way, I think, is to do a single subtree search and
then blast deletes for all leafs. As you get responses back,
issue deletes for entry that becomes (by prior deletes) a
leaf.
There are non-portable extensions that you might experiment
with. But I suggest you stir clear of them. Besides being
non-portable, the extensions I've seen so far don't support
distributed directories. (That is, the subtree may not
necessarily be held within one context.)
Kurt
|
Try Searching:
servers, voip, java, networking, microsoft ...
|
|
|
|