Microsoft Technology Licensing, LLC

Åge Andre Kvalnes

Jan-Ove Almli Karlberg

Tor Kreutzer

Amund Kronen Johansen

Steffen Viken Valvåg

Dag Steinnes Eidesen

Helge Grenager Solheim

Øystein Torbjørnsen

Peter Dahle Heen

Jeffrey L Wight

Andrei-Alin Corodescu

Charitha Herath Daskon Herath Mudiyanselage

Bård Kvalheim

Runar Bergheim Olsen

Øystein Fledsberg

Shamika Ruklan Jayasundara

Christian Thuv

Kaare Koehler Hoevik

Kai-Marius Sæther Pedersen

Bjørn Erik Olsrød

Dmitriy Meyerzon

John Michael Winn

Nikita Voronkov

John Guiver

Matteo Venanzi

Vladimir V Gvozdev

Alexander Armin Spengler

Ivan Korostelev

Simon Thoresen Hult

Vidar Tveoy Knudsen

Chia-Jiun Tan

Thuy Thanh Duong

Omar Faruk

Andrei Razvan Popov

Daniele Vettorel

Mohamed Azmil Macksood

Gjorgji Rankovski

Nicholas John Elder

Tim Schmidt

Dag Brattli

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

Techniques of federation of data during query time are disclosed herein. One example technique includes upon receiving an indication of interaction of a file by a user of a tenant, determining whether automatic replication of the file to a user shard corresponding to the user is permitted according to a company policy or a legal requirement, the user shard being in a second geographic region. The example technique can then include when automatic replication of the file is not permitted, storing the file in a tenant shard corresponding to the tenant in a network storage in the first geographic region and instead of replicating the file to the user shard in the second geographic region, creating, in the user shard in the second geographic region, a file reference that is a pointer to the file stored in the tenant shard in the network storage in the first geographic region.

Federation of data during query time in computing systems

The disclosed technology is generally directed to graph queries with reduced latencies. In one example of the technology, there is a cross-tenancy collaboration between two different tenancies: a first tenancy that is homed in a first geographical region and a second tenancy that is homed in a second geographical region. In the first geographical region, a first set of graph data is stored. The first set of the graph data is associated with the first tenancy. A portion of the first set of the graph data to be copied from the first geographical region to the second geographical region is determined. In response to determining the portion of the first set of the graph data, a copy of the portion of the first set of the graph data is stored in the second geographical region.

Copying graph data between tenancies in different regions

The present disclosure relates to systems, methods, and computer-readable media for utilizing a content access authorization system to determine user access control efficiently and flexibly for digital documents that are stored in different geographic regions. For instance, the content access authorization system can convert sensitive user information for digital documents stored in a first geographic region into a probabilistic data structure that does not include user information and share the probabilistic data structure with a second geographic region. The content access authorization system can then utilize the probabilistic data structure to efficiently pre-filter user document access control for digital documents requested by a user in the second geographic region that are stored in the first geographic region, which significantly saves on latency and computing resource usage by reducing the number of document control access queries needed to be made to the first geographic region.

Utilizing probability data structures to improve access control of documents across geographic regions

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

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.

Optimized record placement in defragmenting graph database

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. Accordingly, query execution may resume in the subsequent isolated collection subpart.

Query execution across multiple graphs

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

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.

Storing data items and identifying stored data items

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.

Managing data resources

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.

Ontology-based graph query optimization

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.

Optimized record placement in graph database

Growing community of inventors

Fetsund, Norway

Åge Andre Kvalnes