Abstract: Techniques of property grouping for change detection in distributed storage systems are disclosed herein. In one embodiment, a method includes grouping multiple properties of a document into multiple groups individually including a subset of the multiple properties. For each of the multiple groups, a hash value of the group is generated based on values of the subset of properties in the group. The method further includes determining whether the generated hash value of the group is different than that of a corresponding group in a previous version of the document in the distributed storage system. In response to determining that generated hash value of the group is not different than that of the corresponding group in the previous version, metadata is inserted into the new version of the document indicating that none of the subset of properties in the group has changed.

Abstract: Techniques of granular change detection in distributed storage system are disclosed herein. In one embodiment, a method includes receiving a subset of data representing a new version of a document with multiple properties. The subset of data includes hash values corresponding to the properties of the document. The method further includes for each of the properties, performing a comparison of the hash values in the new version to that of the properties in a previous version of the document. Based on the performed comparison, whether the property has changed in the new version of the document is determined. The method can then include, transmitting a notification to one or more computing services previously registered to receive a notification regarding a change in the identified one of the properties without transmitting the notification to other computing services not registered to receive the notification.

Abstract: In non-limiting examples of the present disclosure, systems, methods and devices for recommending a shared connection are presented. A set of shared connections between a first application user and a second application user may be identified. A determination may be made that a communication value between the first and second application users is below a recommendation surfacing threshold. A communication value between each application user of the set of shared connections and the first user may be calculated. A communication value between each application user of the set of shared connections and the second user may be calculated. One or both of the calculated communication values may be utilized to rank the shared connections based on importance to the first user, importance to the second user, and/or importance to the first user and the second user. One or more top ranked candidate user profiles may be promoted on a graphical user interface.

Abstract: A method comprising: pre-generating insights for each of a plurality of user-content combinations, each user-content combination comprising a different respective combination one of a plurality of first users and one of a plurality of first pieces of content, wherein each insight specifies a relationship type and other content having that relationship with the respective first content; subsequently receiving a query seeking insights on a target one of the first users and first pieces of content; based on the query, identifying the respective set of insights for that user-content combination; subsequently pruning away one or more insights which specify no related pieces of content to which the target user is permitted access; and outputting at least one of the remaining subset of insights to the target user.

Abstract: A method comprising: storing, in a database, a list of geographical regions in which the party consents to their data being stored; receiving a request to store data of the party, wherein at least one of the data has a region-restriction that restricts the regions in which that data can be stored; determining, based on a respective region-restriction of a respective one of the data, in which of the list of regions the respective data can be stored; storing the data, wherein each respective data is stored in at least one respective storage centre associated with one of the regions according to the determination; storing, in the database, a list comprising a pointer to each respective stored data, wherein the pointer identifies the respective storage centre; receiving a request to retrieve a respective stored data; and using the pointer to route the request to the respective storage centre.

Abstract: A method comprising: storing, in a database, a list of geographical regions in which the party consents to their data being stored; receiving a request to store data of the party, wherein at least one of the data has a region-restriction that restricts the regions in which that data can be stored; determining, based on a respective region-restriction of a respective one of the data, in which of the list of regions the respective data can be stored; storing the data, wherein each respective data is stored in at least one respective storage centre associated with one of the regions according to the determination; storing, in the database, a list comprising a pointer to each respective stored data, wherein the pointer identifies the respective storage centre; receiving a request to retrieve a respective stored data; and using the pointer to route the request to the respective storage centre.

Abstract: Techniques of dynamic hash function composition for change detection in distributed storage systems are disclosed herein. In one embodiment, a method includes dynamically selecting a hash function for a property of a new version of the document and generating a hash value of the value of the property using the selected hash function. The method can then include determining whether the generated hash value of the property of the received new version is different than that of a previous version of the document in the distributed storage system. In response to determining that the generated hash value is different than that of the previous version of the document, a notification can be transmitted to one or more computing services previously registered to receive a notification regarding a change in the property without transmitting the notification to other computing services not registered to receive the notification.

Abstract: Techniques of property grouping for change detection in distributed storage systems are disclosed herein. In one embodiment, a method includes grouping multiple properties of a document into multiple groups individually including a subset of the multiple properties. For each of the multiple groups, a hash value of the group is generated based on values of the subset of properties in the group. The method further includes determining whether the generated hash value of the group is different than that of a corresponding group in a previous version of the document in the distributed storage system. In response to determining that generated hash value of the group is not different than that of the corresponding group in the previous version, metadata is inserted into the new version of the document indicating that none of the subset of properties in the group has changed.

Abstract: Techniques of granular change detection in distributed storage system are disclosed herein. In one embodiment, a method includes receiving a subset of data representing a new version of a document with multiple properties. The subset of data includes hash values corresponding to the properties of the document. The method further includes for each of the properties, performing a comparison of the hash values in the new version to that of the properties in a previous version of the document. Based on the performed comparison, whether the property has changed in the new version of the document is determined. The method can then include, transmitting a notification to one or more computing services previously registered to receive a notification regarding a change in the identified one of the properties without transmitting the notification to other computing services not registered to receive the notification.

Abstract: Controlling access to nodes in a relational graph at query time by using an approximate membership query (AMQ) filter and ordered queries based on historic grants or denials of access according to security context enables a more efficient querying of the relational graph while preserving access controls. Security contexts that grant or deny access to a node are stored in an associated AMQ filter and are queried according to the subject's security context in an order based on the frequency at which the security contexts have previously granted or denied access to nodes in the relational graph.

Abstract: In non-limiting examples of the present disclosure, systems, methods and devices for recommending a shared connection are presented. A set of shared connections between a first application user and a second application user may be identified. A determination may be made that a communication value between the first and second application users is below a recommendation surfacing threshold. A communication value between each application user of the set of shared connections and the first user may be calculated. A communication value between each application user of the set of shared connections and the second user may be calculated. One or both of the calculated communication values may be utilized to rank the shared connections based on importance to the first user, importance to the second user, and/or importance to the first user and the second user. One or more top ranked candidate user profiles may be promoted on a graphical user interface.

Abstract: A method comprising: storing, in a database, a list of geographical regions in which the party consents to their data being stored; receiving a request to store data of the party, wherein at least one of the data has a region-restriction that restricts the regions in which that data can be stored; determining, based on a respective region-restriction of a respective one of the data, in which of the list of regions the respective data can be stored; storing the data, wherein each respective data is stored in at least one respective storage centre associated with one of the regions according to the determination; storing, in the database, a list comprising a pointer to each respective stored data, wherein the pointer identifies the respective storage centre; receiving a request to retrieve a respective stored data; and using the pointer to route the request to the respective storage centre.

Abstract: Controlling access to nodes in a relational graph at query time by using an approximate membership query (AMQ) filter and ordered queries based on historic grants or denials of access according to security context enables a more efficient querying of the relational graph while preserving access controls. Security contexts that grant or deny access to a node are stored in an associated AMQ filter and are queried according to the subject's security context in an order based on the frequency at which the security contexts have previously granted or denied access to nodes in the relational graph.

Abstract: In non-limiting examples of the present disclosure, systems, methods and devices for recommending a shared connection are presented. A set of shared connections between a first application user and a second application user may be identified. A determination may be made that a communication value between the first and second application users is below a recommendation surfacing threshold. A communication value between each application user of the set of shared connections and the first user may be calculated. A communication value between each application user of the set of shared connections and the second user may be calculated. One or both of the calculated communication values may be utilized to rank the shared connections based on importance to the first user, importance to the second user, and/or importance to the first user and the second user. One or more top ranked candidate user profiles may be promoted on a graphical user interface.

Abstract: Approximate Membership Query (AMQ) Filters are used in conjunction with graph queries to a relational graph to provide change monitoring that span views associated with the queries. Each node from the relational graph spanned by a graph query and the index structure for the view are added as members to an AMQ filter. When a change is made to the relational graph, the changed nodes are queried against the AMQ filter. When a changed node is noted as a candidate member of the AMQ filter, the graph query may be rerun to update the view associated with the query. Otherwise, the graph query is not rerun, thus saving computing resources and improving the systems hosting and querying the relational graph.

Abstract: Reductions in latencies and improvements in computational efficiency when analyzing data stored in a relational graph by integrating analytical capabilities into graph queries. Instead of a user having to run a graph query and then perform analytics on the resulting subgraph via separate requests, the user is enabled to run analytics at the time the graph query is run via a single request to the database maintaining the relationship graph, which improves the computationally efficiency of analyzing relational graphs and thereby improves the functionality of the computing devices hosting the relational graphs and running the queries and analytics.

Abstract: In one aspect, a data item is written to a data chunk of a stream segment. The stream segment includes a stream segment header and a plurality of data chunks. A first identifier of the data item is written to the stream segment header of the stream segment. A second identifier of the data item is written to a header of the data chunk of the stream segment. In another aspect, a stream segment header of a stream segment is queried with a query identifier. The querying identifies if any of the data items in the data chunks of the stream segment have the query identifier. If any of the data items in the data chunks of the stream segment have the query identifier, the data chunks of the stream segment are queried with the query identifier to identify which data chunks of the stream segment have the query identifier.

Abstract: A method comprising: pre-generating insights for each of a plurality of user-content combinations, each user-content combination comprising a different respective combination one of a plurality of first users and one of a plurality of first pieces of content, wherein each insight specifies a relationship type and other content having that relationship with the respective first content; subsequently receiving a query seeking insights on a target one of the first users and first pieces of content; based on the query, identifying the respective set of insights for that user-content combination; subsequently pruning away one or more insights which specify no related pieces of content to which the target user is permitted access; and outputting at least one of the remaining subset of insights to the target user.

Abstract: Reductions in latencies and improvements in computational efficiency when analyzing data stored in a relational graph by integrating analytical capabilities into graph queries. Instead of a user having to run a graph query and then perform analytics on the resulting subgraph via separate requests, the user is enabled to run analytics at the time the graph query is run via a single request to the database maintaining the relationship graph, which improves the computationally efficiency of analyzing relational graphs and thereby improves the functionality of the computing devices hosting the relational graphs and running the queries and analytics.

Abstract: Systems, methods, and computer readable devices embodying instructions are provided herein for reducing latencies and/or improving computational efficiency when traversing data stored in a relational graph by caching subgraphs and enabling the utilization thereof. More specifically, after a user performs a graph query, the resulting subgraphs of the graph query are cached in a reusable form. Subsequent graph queries are able to identify cached subgraphs based on the graph query. Further, the subsequent graph query is operable to integrate the cached subgraphs as part of the result of subsequent graph query, which may include a portion or the entire result of the subsequent graph query being composed from cached subgraphs, thereby improving the computational efficiency and performance of querying relational graphs, reducing the query execution cost required to traverse the relational graphs, and improving the functionality of the computing devices hosting the relational graphs and running the queries.