Abstract: Systems and methods are described for authorizing access to resources to entities by representing objects in a graph database. Entities and resources are represented by nodes in the graph, and permissions by edges connecting the nodes. Nodes may be grouped into groupings, the inclusion of a node in a group being represented by an edge. The graph comprises one or more bipartite graphs, such that nodes of one set do not have edges connecting nodes in the set. Navigation of the graph is performed to determine permissions for the entity to access the resources, such as by utilizing edges and inverse edges in the graph to walk a path to the center of the graph, the edges being associated with the permission required to perform the access.

Abstract: Systems and methods are described for authorizing access to resources to entities by representing objects in a graph database. Entities and resources are represented by nodes in the graph, and permissions by edges connecting the nodes. Nodes may be grouped into groupings, the inclusion of a node in a group being represented by an edge. The graph comprises one or more bipartite graphs, such that nodes of one set do not have edges connecting nodes in the set. Navigation of the graph is performed to determine permissions for the entity to access the resources, such as by utilizing edges and inverse edges in the graph to walk a path to the center of the graph, the edges being associated with the permission required to perform the access.

Abstract: Methods and systems for performing heterogeneous computations on homogeneous input data are disclosed. A plurality of computational specifications are distributed among a plurality of worker nodes. The computational specifications comprise definitions of a plurality of heterogeneous computations. The heterogeneous computations are performed using the worker nodes. Individual ones of the heterogeneous computations are performed based on the set of input data and corresponding ones of the computational specifications, and individual ones of the heterogeneous computations produce respective results. An aggregate result is generated based on the respective results of the heterogeneous computations.

Abstract: Systems and techniques to access and/or configure information in graph store are provided. In some embodiments, a state table can be generated in addition to a main table, such as a distributed hash table embodying the graph store. The state table can include information indicative of a state of a relationship between a first node and a second node in the graph store. Availability of the state table can permit the control of termination of an update in scenarios of inconsistency and/or concurrent updates. As such, updates to a pair of nodes, each having one or more records, can leverage the state table to access the record(s) of the nodes and to modify an edge associated with the node. The state table also can permit controllably terminating an update and/or ensuring that consistency of the graph store is maintained after the update. Approaches to resolve error during updates to the graph store also are provided.