Microsoft Technology Licensing, LLC

Age Kvalnes

Jan-Ove Almli Karlberg

Tor Kreutzer

Jon Meling

Amund Kronen Johansen

Dag Steinnes Eidesen

Peter Dahle Heen

Steffen Viken Valvag

Dmitriy Meyerzon

Nikita Voronkov

Helge Grenager Solheim

Jeffrey L Wight

Praveen Kumar Reddy Malireddy

A method of maintaining a key-value store comprising a first record structure in which each key comprises an index and each value comprises a respective set of item IDs, and a second record structure in which each key comprises an item ID and each value comprises a respective item of data. Each new item ID of a group is added, starting at the root level of a tree structure: I) determining whether the current record will exceed a maximum size limit if the new item ID is included therein, and if not, including the new item ID, but II) if so, identifying a number of records at the next level of the tree structure, and applying a deterministic transformation to the item ID of the new item to determine one of the identified number of records, and repeating from I) with the determined record now as the current record.

Multi-record index structure for key-value stores

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.

Access controlled graph query spanning

Systems and methods for providing notification delivery based on utilization of bloom filters are provided. A collaboration system obtains subscriber information for each user of a collaboration system, whereby the subscriber information corresponds to one or more features of content that are relevant to each user. The collaboration system hashes the subscriber information to generate a bloom filter for each user. The collaboration system receives an article to be published, whereby the article comprises a set of features. The set of features is hashed to obtain a hash set. The hashing of the set of features is performed using same hashing functions as that used to generate the bloom filter. The collaboration system compares the hash set to the bloom filter to identify a match, whereby the match indicates a feature of the article matches the subscriber information. The collaboration system generates a list of recipients based on the match.

System of mobile notification delivery utilizing bloom filters

Growing community of inventors

Tromsø, Norway

Age Kvalnes