[
https://issues.apache.org/jira/browse/OAK-333?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13933158#comment-13933158
]
Thomas Mueller commented on OAK-333:
------------------------------------
Revision 1577129: long paths are now treated specially: the parent path is
hashed (SHA-256). The thresholds can be configured using the system properties
"oak.pathShort" (default 330, number of characters) and "oak.pathLong" (default
700, number of bytes of the UTF-8 representation of the parent). The
"oak.pathShort" is just an optimization so that short paths are not further
investigated.
> 1000 byte 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: Thomas Mueller
> Priority: Minor
> Fix For: 0.19
>
> Attachments: NodeNameLimitsTest.java, 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 was sent by Atlassian JIRA
(v6.2#6252)
