Abstract: Examples of the present disclosure describe systems and methods for query execution across multiple graphs. In an example, a graph or isolated collection may be split into multiple subparts, such that each subpart may store information of the isolated collection. Cross-collection reference resources may be used to reference resources that are stored by other isolated collection subparts. A breadth-first search of an isolated collection subpart may be performed in order to identify matches or potential matches in an isolated collection subpart. In an example, a potential match may comprise a cross-collection reference resource, which may reference a resource in another isolated collection subpart. Once query execution has completed in the isolated collection subpart, query execution may be paused and transferred to another isolated collection subpart that comprises a resource referenced by a cross-collection resource reference.

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: Examples of the present disclosure describe systems and methods for ontology-based graph query optimization. In an example, ontology data relating to a graph or isolated collection may be collected. The ontology data may comprise uniqueness and topology information and may be used to reformulate a query in order to yield a query that is more performant than the original query when retrieving target information from a graph. In an example, reformulating a query may comprise reordering one or more parameters of the query relating to resources, relationships, and/or properties based on uniqueness information. In another example, the query may be reformulated by modifying the resource type to which the query is anchored based on the topology information. The reformulated query may then be executed to identify target information in the isolated collection, thereby identifying the same target information as the original query, but in a manner that is more performant.

Abstract: Methods and systems are disclosed for optimizing record placement in a graph by minimizing fragmentation when writing data. Issues with fragmented data within a graph database are addressed on the record level by placing data that is frequently accessed together contiguously within memory. For example, a dynamic rule set may be developed based on dynamically analyzing access patterns of the graph database, policies, system characteristics and/or other heuristics. Based on statistics regarding normal query patterns, the systems and methods may identify an optimal position for certain types of edges that are often traversed with respect to particular types of nodes.

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: Examples of the present disclosure describe systems and methods for ontology-based graph query optimization. In an example, ontology data relating to a graph or isolated collection may be collected. The ontology data may comprise uniqueness and topology information and may be used to reformulate a query in order to yield a query that is more performant than the original query when retrieving target information from a graph. In an example, reformulating a query may comprise reordering one or more parameters of the query relating to resources, relationships, and/or properties based on uniqueness information. In another example, the query may be reformulated by modifying the resource type to which the query is anchored based on the topology information. The reformulated query may then be executed to identify target information in the isolated collection, thereby identifying the same target information as the original query, but in a manner that is more performant.

Abstract: Methods and systems are disclosed for optimizing record placement in a graph by minimizing fragmentation when writing data. Issues with fragmented data within a graph database are addressed on the record level by placing data that is frequently accessed together contiguously within memory. For example, a dynamic rule set may be developed based on dynamically analyzing access patterns of the graph database, policies, system characteristics and/or other heuristics. Based on statistics regarding normal query patterns, the systems and methods may identify an optimal position for certain types of edges that are often traversed with respect to particular types of nodes.

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: A system and method for surfacing content relevant is described. The system computes a rank score for each item of a plurality of items that are accessible from a user of an enterprise application. The system identifies a set of relevant items from the plurality of items based on the rank score for each item of the plurality of items. The system surfaces the set of relevant items within a context of a communication application of the user without receiving, from the user, a query for any of the items in the set of relevant items.

Abstract: Examples of the present disclosure describe systems and methods for query execution across multiple graphs. In an example, a graph or isolated collection may be split into multiple subparts, such that each subpart may store information of the isolated collection. Cross-collection reference resources may be used to reference resources that are stored by other isolated collection subparts. A breadth-first search of an isolated collection subpart may be performed in order to identify matches or potential matches in an isolated collection subpart. In an example, a potential match may comprise a cross-collection reference resource, which may reference a resource in another isolated collection subpart. Once query execution has completed in the isolated collection subpart, query execution may be paused and transferred to another isolated collection subpart that comprises a resource referenced by a cross-collection resource reference.

Abstract: A high percentage of received communications are from external entities. In response to receiving a communication from a sender associated with an entity, the entity may be authenticated and contextualized by retrieving and processing contact information for people at the entity that are directly and/or indirectly associated with a recipient of the communication. For example, contact information for people at the entity who have previously communicated with and/or are connected to the recipient or users related to the recipient, for example, may be retrieved from one or more directory services, social networks, and/or professional networks. The contact information may be processed to create corresponding contact objects, and the contact objects may be processed to create an entity object for the entity that comprises one or more connections between the recipient and the people at the entity. The entity object may be provided to the recipient for display.

Abstract: Examples of the present disclosure describe systems and methods for query execution across multiple graphs. In an example, a graph or isolated collection may be split into multiple subparts, such that each subpart may store information of the isolated collection. Cross-collection reference resources may be used to reference resources that are stored by other isolated collection subparts. A breadth-first search of an isolated collection subpart may be performed in order to identify matches or potential matches in an isolated collection subpart. In an example, a potential match may comprise a cross-collection reference resource, which may reference a resource in another isolated collection subpart. Once query execution has completed in the isolated collection subpart, query execution may be paused and transferred to another isolated collection subpart that comprises a resource referenced by a cross-collection resource reference.

Abstract: Methods and systems are disclosed for optimizing record placement in defragmenting a graph database. Issues with fragmented data within a graph database are addressed on the record level by placing data that is frequently accessed together contiguously within memory. For example, a dynamic rule set may be developed based on dynamically analyzing access patterns of the graph database, policies, system characteristics and/or other heuristics. Based on statistics regarding normal query patterns, the systems and methods may identify an optimal position for certain types of edges that are often traversed with respect to particular types of nodes.

Abstract: Systems and methods for contact card customization. More specifically, the systems and methods herein leverage authentication protocols and the branded indicators for message identification (BIMI) protocol to allow organizations to display customized contact card information in their sent messages. As such, the systems and methods provide customizable, dynamic, and secure contact cards that can distinguish between an individual and an organization unlike previously utilized contact card systems and methods.

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 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 system and method for surfacing content relevant is described. The system computes a rank score for each item of a plurality of items that are accessible from a user of an enterprise application. The system identifies a set of relevant items from the plurality of items based on the rank score for each item of the plurality of items. The system surfaces the set of relevant items within a context of a communication application of the user without receiving, from the user, a query for any of the items in the set of relevant items.

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: Relevance based dynamic navigation is provided. A communication application searches communications to identify hashtags associated with the communications. A relevance score is computed for each hashtag based on a relevance criteria associated with the hashtags. The hashtags are ranked based on the relevance score. Next, the ranked hashtags are presented in a navigation user interface.