You are viewing a plain text version of this content. The canonical link for it is here.

Posted to oak-issues@jackrabbit.apache.org by "Thomas Mueller (JIRA)" <ji...@apache.org> on 2015/09/24 15:49:05 UTC

[jira] [Commented] (OAK-3447) Parallelize recursive usage of compareAgainstBaseState

    [ https://issues.apache.org/jira/browse/OAK-3447?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=14906360#comment-14906360 ] 

Thomas Mueller commented on OAK-3447:
-------------------------------------

It would be good to know the average and medium number of child nodes processed.

> Parallelize recursive usage of compareAgainstBaseState
> ------------------------------------------------------
>
>                 Key: OAK-3447
>                 URL: https://issues.apache.org/jira/browse/OAK-3447
>             Project: Jackrabbit Oak
>          Issue Type: Improvement
>          Components: core
>    Affects Versions: 1.3.6
>         Environment: All, especially document
>            Reporter: Joel Richard
>              Labels: performance
>
> In order to improve the performance of compareAgainstBaseState, it would help to parallelize the recursive usage of compareAgainstBaseState. The idea is that each sub tree which has a different revision would then be processed in parallel (although it would probably suffice to only fork the process when the nodes are not cached). This should significantly reduce the time which is lost while waiting for an external database assumed that there are at least two changes between the base revisions.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)