Abstract: Examples of the present disclosure describe systems and methods for determining authoritative documents based on implicit interlinking and communication signals. In aspects, a search operation may be initiated from one or more applications or services. The search operation may be processed to identify search information, such as one or more content items, content topics, or entities. The identified search information may be used to search one or more data sources for implicit relationships between the search information and content items and/or entities stored by the data sources. The results of the search may be collected and ranked according to one or more criteria. The ranked results may be provided in response to the search operation.

Abstract: Examples of the present disclosure describe systems and methods for leveraging interlinking between resources to determine shared knowledge. In aspects, user interaction with one or more applications or services may be detected. User input associated with the user interaction may be processed to identify information, such as one or more content items, content topics, or entities. The identified information may be used to search one or more data sources for relationships between the identified information and content items, topics, and/or entities stored by the data sources. The results of the search may be collected and/or evaluated to identify the knowledge level of one or more entities with one or more topics. Based on the evaluation, an indication of the identified knowledge level(s) may be provided.

Abstract: Computerized systems are provided for detecting or receiving a sharing gesture in a communication group and responsively instantiating or updating one or more computer objects that include rich contextual data associated with the sharing gesture. These computer objects can be instantiated or updated based on one or more rules or policies. These computer objects or associated indications can be surfaced back to a user to give the user context regarding the shared resource. It can be determined whether a user has access to (or permission to access) such a computer object and/or an associated computer resource for presentation to the user.

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: 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: 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 described herein generally relate to a computer system for generating a knowledge graph storing a plurality of entities and to displaying a topic page for an entity in the knowledge graph. The computer system performs a mining of source documents within an enterprise intranet to determine a plurality of entity names. The computer system generates an entity record within the knowledge graph for a mined entity name based on an entity schema and the source documents. The entity record includes attributes aggregated from the source documents. The computer system receives a curation action on the entity record from a first user. The computer system updates the entity record based on the curation action. The computer system displays an entity page including at least a portion of the attributes to a second user based on permissions of the second user to view the source documents.

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: 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: 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: 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: Described herein is a system and method for determining whether a detected issue in a computing system is a bug introduced by a developer or an intermittent issue. When an issue is detected, information about the issue is received. A determination is then made as to whether the issue is a new issue or whether it has been previously detected. When it is determined that the issue is a new issue, information about the issue is stored in a storage device. A feature vector is generated for the issue and is analyzed to determine a probability that the issue is a bug. When it is determined that the issue is a bug, the occurrence of the issue is reported to a user of the system that can correct the bug. Once the bug is corrected, the correction is provided back to the system and is used to train the system.

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: Described herein is a system and method for determining whether a detected issue in a computing system is a bug introduced by a developer or an intermittent issue. When an issue is detected, information about the issue is received. A determination is then made as to whether the issue is a new issue or whether it has been previously detected. When it is determined that the issue is a new issue, information about the issue is stored in a storage device. A feature vector is generated for the issue and is analyzed to determine a probability that the issue is a bug. When it is determined that the issue is a bug, the occurrence of the issue is reported to a user of the system that can correct the bug. Once the bug is corrected, the correction is provided back to the system and is used to train the system.

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: 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.