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 "Jukka Zitting (JIRA)" <ji...@apache.org> on 2013/02/18 12:37:13 UTC

[jira] [Created] (OAK-632) SegmentMK: Efficient updates of flat nodes

Jukka Zitting created OAK-632:
---------------------------------

             Summary: SegmentMK: Efficient updates of flat nodes
                 Key: OAK-632
                 URL: https://issues.apache.org/jira/browse/OAK-632
             Project: Jackrabbit Oak
          Issue Type: Sub-task
          Components: segmentmk
            Reporter: Jukka Zitting
            Priority: Minor


The SegmentMK already uses the Hash Array Mapped Trie (HAMT) data structure for the child node entries of a node. This persistent data structure allows child node entries to be added, modified or changed in O(log n) added bytes of storage. However, we so far only have the code to write a new HAMT data structure from scratch, not the code to selectively update just parts of it. To properly support large, flat content we need to implement also the latter part.

--
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