There is some need for subtree operations besides moddn, at least subtree deletion, but the draft proposal doesn't handle transactionality, locking, and distribution (referrals) - which I believe are the hardest things related to subtree operations.
Rob
Bruce Greenblatt wrote:
Here's a little draft that I wrote that describes some extended operations
that work against subtrees in LDAP. In attempting to build LDAP
applications requirements for copying, modifying and deleting subtrees come
up repeatedly. These types of operations are most effectively performed by
LDAP servers atomically, rather than by LDAP clients through the use of the
standard LDAP operations. So, see:
http://search.ietf.org/internet-drafts/draft-greenblatt-ldapext-sos-00.txt,
or another I-D repository near you...Bruce