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: In non-limiting examples of the present disclosure, systems, methods and devices for recommending content are presented. An electronic communication between a plurality of members of a common entity may be received. A link to web content in the electronic communication may be identified. A number of instances that the link has been electronically shared with members of the common entity may be determined. A determination may be made as to whether a content propagation threshold has been exceeded based on electronic sharing of the link amongst members of the common entity. The link may be provided for propagation upon determining that the content propagation threshold has been exceeded.

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: In non-limiting examples of the present disclosure, systems, methods and devices for recommending content are presented. An electronic communication between a plurality of members of a common entity may be received. A link to web content in the electronic communication may be identified. A number of instances that the link has been electronically shared with members of the common entity may be determined. A determination may be made as to whether a content propagation threshold has been exceeded based on electronic sharing of the link amongst members of the common entity. The link may be provided for propagation upon determining that the content propagation threshold has been exceeded.

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: In non-limiting examples of the present disclosure, systems, methods and devices for recommending content are presented. An electronic communication between a plurality of members of a common entity may be received. A link to web content in the electronic communication may be identified. A number of instances that the link has been electronically shared with members of the common entity may be determined. A determination may be made as to whether a content propagation threshold has been exceeded based on electronic sharing of the link amongst members of the common entity. The link may be provided for propagation upon determining that the content propagation threshold has been exceeded.

Abstract: In non-limiting examples of the present disclosure, systems, methods and devices for recommending content are presented. An electronic communication between a plurality of members of a common entity may be received. A link to web content in the electronic communication may be identified. A number of instances that the link has been electronically shared with members of the common entity may be determined. A determination may be made as to whether a content propagation threshold has been exceeded based on electronic sharing of the link amongst members of the common entity. The link may be provided for propagation upon determining that the content propagation threshold has been exceeded.

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: 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: In non-limiting examples of the present disclosure, systems, methods and devices for recommending content are presented. An electronic communication between a plurality of members of a common entity may be received. A link to web content in the electronic communication may be identified. A number of instances that the link has been electronically shared with members of the common entity may be determined. A determination may be made as to whether a content propagation threshold has been exceeded based on electronic sharing of the link amongst members of the common entity. The link may be provided for propagation upon determining that the content propagation threshold has been exceeded.

Abstract: In non-limiting examples of the present disclosure, systems, methods and devices for recommending content are presented. An electronic communication between a plurality of members of a common entity may be received. A link to web content in the electronic communication may be identified. A number of instances that the link has been electronically shared with members of the common entity may be determined. A determination may be made as to whether a content propagation threshold has been exceeded based on electronic sharing of the link amongst members of the common entity. The link may be provided for propagation upon determining that the content propagation threshold has been exceeded.

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: 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: A query box application provides an inline and context aware query box. An interaction with a content displayed in a client application is detected, in which the interaction is interpreted to activate a query box. The query box is configured based on a context in response to a determination of the context associated with the content. A text of a part of the content may be used to search local and external sources to find resulting data associated with the text. The query box may be rendered with the resulting data in proximity to a location associated with the interaction.