While multiple techniques exist to utilize the tree structure of the  Extensible Markup Language (XML) regarding integrity checks, they all rely on adaptions of the  Merkle Tree : All children are acting as one slice regarding the check-sum of one node with the help of an one-way hash concatenation. This results in postorder traversals regarding the (re-)computation of the integrity structure within modification operations. With our approach we perform nearly in-time updates of the entire integrity structure. We therefore equipped an  XHash -based approach with an incremental hash function. This replaces postorder traversals by adapting only the incremental modifications to the check-sums of a node and its ancestors. With experimental results we prove that our approach only generates a constant overhead depending on the depth of the tree while native  DOMHash  implementations produce an overhead based on the depth and the number of all nodes in the tree. Consequently, our approach called  Rolling Boles  generates sustainable impact since it facilitates instant integrity updates in constant time.
['Sebastian Graf', 'Sebastian Kay Belle', 'Marcel Waldvogel']
Rolling boles, optimal XML structure integrity for updating operations