[
https://issues.apache.org/jira/browse/OAK-333?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13564370#comment-13564370
]
Thomas Mueller commented on OAK-333:
------------------------------------
I think using the hash would be relatively bad for read performance for a
larger repository (for example when traversing all nodes), similar to the
randomly distributed node ids of Jackrabbit 2.x. How bad exactly is an option
question of course, we would need to run some tests. In order to run such
tests, would it be possible to use a switch (static final boolean) in the code,
so that this can be tested?
Is <hashOfParentPath> a cryptographic hash?
> 1000 character path limit in MongoMK
> ------------------------------------
>
> Key: OAK-333
> URL: https://issues.apache.org/jira/browse/OAK-333
> Project: Jackrabbit Oak
> Issue Type: Bug
> Components: mongomk
> Affects Versions: 0.5
> Reporter: Mete Atamel
> Assignee: Mete Atamel
> Priority: Minor
> Attachments: OAK-333.patch
>
>
> In an infinite loop try to add nodes one under another to have N0/N1/N2...NN.
> At some point, the current parent node will not be found and the current
> commit will fail. I think this happens when the path length exceeds 1000
> characters. Is this enough for a path? I was able to create this way only 222
> levels in the tree (and my node names were really short N1, N2 ...)
> There's an automated tests for this: NodeExistsCommandMongoTest.testTreeDepth
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators
For more information on JIRA, see: http://www.atlassian.com/software/jira
