[
https://issues.apache.org/jira/browse/OAK-333?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13526327#comment-13526327
]
Michael Dürig commented on OAK-333:
-----------------------------------
bq. There are other solutions that don't require recursion, such as replace
multiples of limit/2 bytes in once step.
But that would result in similar limitations wrt. to sharding as you describe
above since a much longer path with the same prefix as a shorter path might end
up with a different replacement for its initial part.
The hash based approach avoids that. Here the limitation wrt. sharding only
starts to show when sharding is actually done at a very deep path level which I
think is quite unlikely.
> 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: mk, 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
