Abstract: A method for traversing a node tree, having a root node and a hierarchy of child nodes, to a selected child node is described. A node identifier of the root node is determined by performing a hash function with at least a seed value for the node tree. Each child node of the hierarchy has a respective node identifier determined by performing the hash function with i) the seed value, ii) a node identifier of a parent node of the child node, and iii) a child index of the parent node. The selected child node's node identifier is determined by performing the hash function with i) the seed value, ii) the node identifier of the selected child node's parent node, and iii) the child index of the parent node for the selected child node. A retrieval of data stored at a location indicated by the node identifier of the selected child node is caused.

Abstract: A method for sharing changes to an electronic document is described. A share request is received, at a first computing device, that indicates a change to a shared element of the electronic document that is directly changed by a user. A first update set of elements that should be updated based on the change is determined by the first computing device, the first update set including the shared element and one or more elements not directly changed by the user. For each element of the first update set, the first computing device selects between a second update set and a third update set based on a respective dependency relationship with the shared element. Elements of the first update set are associated with the corresponding selected update set. A synchronous update for the second update set and an asynchronous update for the third update set are performed.