Abstract: Systems and methods for identifying and transacting with accounts across multiple external systems using inter-system account identifiers, without exposing internal account identifiers of an originating system, are disclosed. An example method, executed by the originating system, includes generating a first and a second inter-system account identifier based on a first and a second request, respectively, received at the originating system from a first and a second external system, respectively, that provide different services to an internal account of the originating system. The first and second inter-system account identifiers are communicated to the first and the second external system, respectively.

Abstract: A software platform includes a frontend and a backend application instance. A user can operate the frontend to modify a data object stored in a database of the backend application instance. The data object may be associated with a higher-order object, referred to as an entity of the software platform. One or more data consumers (e.g., search engine indexing services) may require as input a full computed state of platform-level objects such as entities. The software platform defers computation of entities until necessary by inserting work items into a work item queue that reference entities in need of full state computation. Worker nodes wait specified deferral periods before computing full entity states and transmitting the full computed states to the one or more data consumers, thereby significantly reducing redundant computation of full entity states.

Abstract: Described herein is a computer implemented method for inserting a new item to a tree-structured dataset. The method comprises: calculating a new item data summary; generating a new leaf node for storing the new item and the new item data summary; adding the new leaf node to the dataset; and recalculating data summaries for all internal dataset nodes in an update path starting at a parent of the new leaf node and ending at a root node of the dataset. The data summary for a given internal node in the update path is calculated based on data summaries for each of the given internal node's children nodes.

Abstract: Described herein is a computer implemented method for managing summary data maintained for each node in a tree-structured dataset. The method comprises initiating a summary data reset process which comprises: determining a new summary data length; recalculating data summaries for all nodes in the tree-structured dataset so that data summaries for all nodes have a length is equal to the new summary data length, and wherein for a given subtree of the tree-structured dataset, recalculating data summaries comprises: initially recalculating data summary items for leaf nodes of the given subtree; and following recalculation of data summary items for leaf nodes, working progressively up the given subtree to a root of the given subtree.

Abstract: Described herein is a computer implemented method. A computer system receives a first request to generate a first inter-system account identifier that is associated with a first external system and a first internal account. In response, a first inter-system account identifier corresponding to the first external system and the first internal account is generated. The system also receives a second request to generate a second inter-system account identifier that is associated with a second external system and the first internal account. In response, a second inter-system account corresponding to the second external system and the first internal account is generated, the second inter-system account identifier being different to the first inter-system account identifier.

Abstract: Described herein is a computer implemented method for determining whether a tree-structured dataset contains a particular data item. The method comprises calculating a particular item data summary using a data summary calculation algorithm and determining whether an internal node data summary matches the particular item data summary. In response to determining that the internal node data summary does not match the particular item data summary, a subtree defined by the internal node is determined not to contain the particular item.

Abstract: Described herein is a computer implemented method for determining whether a tree-structured dataset contains a particular data item. The method comprises calculating a particular item data summary using a data summary calculation algorithm and determining whether an internal node data summary matches the particular item data summary. In response to determining that the internal node data summary does not match the particular item data summary, a subtree defined by the internal node is determined not to contain the particular item.

Abstract: Described herein is a computer implemented method for inserting a new item to a tree-structured dataset. The method comprises: calculating a new item data summary; generating a new leaf node for storing the new item and the new item data summary; adding the new leaf node to the dataset; and recalculating data summaries for all internal dataset nodes in an update path starting at a parent of the new leaf node and ending at a root node of the dataset. The data summary for a given internal node in the update path is calculated based on data summaries for each of the given internal node's children nodes.

Abstract: Described herein is a computer implemented method for managing summary data maintained for each node in a tree-structured dataset. The method comprises initiating a summary data reset process which comprises: determining a new summary data length; recalculating data summaries for all nodes in the tree-structured dataset so that data summaries for all nodes have a length is equal to the new summary data length, and wherein for a given subtree of the tree-structured dataset, recalculating data summaries comprises: initially recalculating data summary items for leaf nodes of the given subtree; and following recalculation of data summary items for leaf nodes, working progressively up the given subtree to a root of the given subtree.