On 09/16/2015 03:11 PM, Adrian Damian wrote:
Hi There, The scenario is simple: we have a subtree in the DIT with a few thousand children node. The parent node of the subtree has a few acis including a couple of macro acis that apply to each of the child nodes. We've observed a significant performance degradation when trying to list all the children in the presence of the macro acis. Profiling on the client code show that although the first few child nodes were fetched quite fast there is a clear delay buildup as the retrieval progresses. The buildup is not present when the macro acis are removed. Also, it is faster to split the list in chunks and retrieve them sequentially. Is it possible that as the macro acis are resolved they are added to the list of acis of the parent node so that the last nodes are evaluated against many more acis than the first ones and hence the observed delay in their retrieval? Is there a workaround for this?
What version of 389? rpm -q 389-ds-base
Thank you, Adrian -- 389 users mailing list 389-users@xxxxxxxxxxxxxxxxxxxxxxx https://admin.fedoraproject.org/mailman/listinfo/389-users
-- 389 users mailing list 389-users@xxxxxxxxxxxxxxxxxxxxxxx https://admin.fedoraproject.org/mailman/listinfo/389-users
