Microsoft Technology Licensing, LLC

Andrei-Alin Corodescu

Jan-Ove Almli Karlberg

Helge Grenager Solheim

Åge Andre Kvalnes

Tor Kreutzer

Vidar Tveoy Knudsen

Dmitriy Meyerzon

John Michael Winn

Nikita Voronkov

John Guiver

Matteo Venanzi

Alexander Armin Spengler

Vladimir V Gvozdev

Jeffrey L Wight

Ivan Korostelev

Simon Thoresen Hult

Thuy Thanh Duong

Charitha Herath Daskon Herath Mudiyanselage

Chia-Jiun Tan

Andrei Razvan Popov

Bernt Lervik

Omar Faruk

Gjorgji Rankovski

The present disclosure describes utilizing an access control cache associated with a key resource (e.g., node) of a knowledge graph that quickly and efficiently reduces the uncertainty of which other resources (e.g., connected nodes) in a knowledge graph are accessible to a given user identifier. For example, a node caching system dynamically generates, updates, manages, and utilizes access control caches associated with key nodes to signal access control rights of connected nodes in a knowledge graph with respect to a user identifier. In many instances, the node caching system improves efficiency over existing knowledge graph systems by providing access control rights information of connected nodes from an access control cache of a key node without needing to traverse the knowledge graph to other nodes or to travel to other connected nodes stored on separate computing devices.

Access control verification in knowledge graphs by utilizing dynamic node-based access control caches

Particular aspects of this disclosure relate to computerized systems for generating and using improved data structures and functionality to efficiently render different multiple access-controlled resources (or properties of access-controlled resources) that are part of a concept. Often times, two or more resources of a concept or properties of a resource are subject to different access controls. This adds computing complexity as to whether or not a user is granted access to the entire concept or resource, a portion of the concept or resource, or none of the concept or resources and what exactly is surfaced back to the user when there are resources or properties the user does and does not have access to. Some embodiments accordingly render an efficient composite view of concepts or resources where some resources or properties are accessible by the requesting user, while other resources or properties are not accessible by the requesting user.

Efficient retrieval and rendering of access-controlled computer resources

The technology described herein protects the privacy and security of data stored in a knowledge graph ('graph') by enforcing visibility policies when returning property information in response to a query or other attempt to extract property information from the graph and/or about the graph. The visibility policies may be stored with the object and used to prevent restricted properties from being extracted from the object, let alone the graph. The object-specific visibility policy may be stored in the storage layer of the knowledge-graph object with the object properties and content. Some implementations may include multiple visibility records for a single object. Together the visibility records form the object visibility policy. An object visibility policy may have a single visibility record or multiple visibility records.

Property-level visibilities for knowledge-graph objects

Examples of the present disclosure describe systems and methods for aliased data insertions/retrieval for key-value stores. In aspects, a data set comprising a primary key, one or more secondary keys ('aliases'), and data values may be received by a data storage system. The system may allocate an internal identifier to the primary key and store the internal identifier and the primary key in a first table. Each of the secondary keys may be used to create a key-value pair comprising the secondary key and the internal identifier. The key-value pair(s) may be stored in the first table with the corresponding primary key. The internal identifier and the data values may be stored in a second table. Subsequently, the primary or secondary key may be used to interrogate the first table for the internal identifier. The internal identifier may then be used to interrogate the second table for the data values.

Aliased data retrieval for key-value stores

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.

Enterprise knowledge graph

Growing community of inventors

Oslo, Norway

Andrei-Alin Corodescu