Patents by Inventor Jan-Ove Almli Karlberg
Jan-Ove Almli Karlberg has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20230126596Abstract: 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.Type: ApplicationFiled: December 22, 2022Publication date: April 27, 2023Applicant: Microsoft Technology Licensing, LLCInventors: Tor KREUTZER, Jan-Ove Almli KARLBERG, Shamika Ruklan JAYASUNDARA, Øystein FLEDSBERG, Øystein TORBJØRNSEN, Åge Andre KVALNES, Helge Grenager SOLHEIM
-
Patent number: 11625412Abstract: 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.Type: GrantFiled: November 16, 2021Date of Patent: April 11, 2023Assignee: Microsoft Technology Licensing, LLCInventors: Jan-Ove Almli Karlberg, Tor Kreutzer, Åge Andre Kvalnes
-
Publication number: 20230079753Abstract: 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.Type: ApplicationFiled: October 31, 2022Publication date: March 16, 2023Applicant: Microsoft Technology Licensing, LLCInventors: Jan-Ove Almli KARLBERG, Andrei-Alin CORODESCU, Helge Grenager SOLHEIM
-
Publication number: 20230034911Abstract: A method and system for creating a learning graph may include accessing a general knowledge graph, the general knowledge graph including a plurality of items of information about a plurality of general knowledge topics, extracting a plurality of learning topics, the plurality of learning topics being topics associated with a desired learning curriculum, identifying associations between one or more of the plurality of learning topics and one or more of the plurality of items of information in the general knowledge graph, upon identifying the associations, utilizing the associations to create a learning graph based on at least one of the one or more of the plurality of learning topics, the one or more of the plurality of items of information and the associations between them, the learning graph being a learning knowledge visualization graph, and transmitting the learning graph to a learning application for use in providing the desired learning curriculum.Type: ApplicationFiled: August 2, 2021Publication date: February 2, 2023Applicant: Microsoft Technology Licensing, LLCInventors: Jan-Ove Almli KARLBERG, Torbjørn HELVIK, Jon MELING
-
Patent number: 11563808Abstract: 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.Type: GrantFiled: November 12, 2020Date of Patent: January 24, 2023Assignee: Microsoft Technology Licensing, LLCInventors: Tor Kreutzer, Jan-Ove Almli Karlberg, Shamika Ruklan Jayasundara, Øystein Fledsberg, Øystein Torbjørnsen, Åge Andre Kvalnes, Helge Grenager Solheim
-
Publication number: 20220398331Abstract: 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.Type: ApplicationFiled: June 9, 2021Publication date: December 15, 2022Inventors: Jan-Ove Almli KARLBERG, Tor KREUTZER, Andrei-Alin CORODESCU, Vidar Tveoy KNUDSEN, Bernt LERVIK
-
Patent number: 11514088Abstract: 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.Type: GrantFiled: January 26, 2021Date of Patent: November 29, 2022Assignee: Microsoft Technology Licensing, LLCInventors: Jan-Ove Almli Karlberg, Andrei-Alin Corodescu, Helge Grenager Solheim
-
Publication number: 20220343013Abstract: 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.Type: ApplicationFiled: May 2, 2022Publication date: October 27, 2022Applicant: Microsoft Technology Licensing, LLCInventors: Tor KREUTZER, Steffen VIKEN VALVAG, Dag Steinnes EIDESEN, Amund Kronen JOHANSEN, Peter Dahle HEEN, Jan-Ove Almli KARLBERG, Jon MELING, Age KVALNES
-
Publication number: 20220318426Abstract: The technology described herein protects the privacy of data stored in a knowledge graph (“graph”) by enforcing privacy policies when returning information in response to a query or other attempt to extract information from the graph and/or about the graph. In one aspect, unauthorized information is trimmed from the information output in response to a query. In other words, the privacy policy for a knowledge graph is enforced during the information extraction process. This is in contrast to other methods that attempt to enforce privacy policies at the information ingestion process or through some other service-level process after information is output from the graph. The privacy policies may be stored in a node of the graph.Type: ApplicationFiled: May 14, 2021Publication date: October 6, 2022Inventors: Helge Grenager SOLHEIM, Jan-Ove Almli KARLBERG, Bernt LERVIK, Vidar Tveoy KNUDSEN, Daniela LEPRI, Elvira MAKHMUTOVA, Marta Emilia NOWAKOWSKA, Tor KREUTZER
-
Publication number: 20220253419Abstract: 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.Type: ApplicationFiled: July 16, 2020Publication date: August 11, 2022Inventors: Jan-Ove Almli KARLBERG, Helge Grenager SOLHEIM, Age Andre KVALNES
-
Publication number: 20220237213Abstract: 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.Type: ApplicationFiled: January 26, 2021Publication date: July 28, 2022Applicant: Microsoft Technology Licensing, LLCInventors: Jan-Ove Almli KARLBERG, Andrei-Alin CORODESCU, Helge Grenager SOLHEIM
-
Patent number: 11347883Abstract: 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.Type: GrantFiled: May 13, 2020Date of Patent: May 31, 2022Assignee: Microsoft Technology Licensing, LLCInventors: Tor Kreutzer, Steffen Viken Valvag, Dag Steinnes Eidesen, Amund Kronen Johansen, Peter Dahle Heen, Jan-Ove Almli Karlberg, Jon Meling, Age Kvalnes
-
Publication number: 20220075791Abstract: 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.Type: ApplicationFiled: November 16, 2021Publication date: March 10, 2022Applicant: Microsoft Technology Licensing, LLCInventors: Jan-Ove Almli KARLBERG, Tor KREUTZER, Åge Andre KVALNES
-
Patent number: 11210312Abstract: 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.Type: GrantFiled: June 8, 2018Date of Patent: December 28, 2021Assignee: Microsoft Technology Licensing, LLCInventors: Jan-Ove Almli Karlberg, Tor Kreutzer, Åge Andre Kvalnes
-
Publication number: 20210288971Abstract: 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.Type: ApplicationFiled: May 30, 2020Publication date: September 16, 2021Inventors: Jan-Ove Almli KARLBERG, Åge Andre KVALNES, Tor KREUTZER, Andrei-Alin CORODESCU, Vidar Tveoy KNUDSEN, Helge Grenager SOLHEIM
-
Patent number: 11086873Abstract: Reductions in latencies and improvements in computational efficiency when analyzing data stored in a relational graph by integrating analytical capabilities into graph queries. Instead of a user having to run a graph query and then perform analytics on the resulting subgraph via separate requests, the user is enabled to run analytics at the time the graph query is run via a single request to the database maintaining the relationship graph, which improves the computationally efficiency of analyzing relational graphs and thereby improves the functionality of the computing devices hosting the relational graphs and running the queries and analytics.Type: GrantFiled: September 30, 2019Date of Patent: August 10, 2021Assignee: Microsoft Technology Licensing, LLCInventors: Tor Kreutzer, Steffen Viken Valvåg, Åge Kvalnes, Amund Kronen Johansen, Jan-Ove Almli Karlberg, Dag Steinnes Eidesen
-
Publication number: 20210067589Abstract: 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.Type: ApplicationFiled: November 12, 2020Publication date: March 4, 2021Applicant: Microsoft Technology Licensing, LLCInventors: Tor KREUTZER, Jan-Ove Almli KARLBERG, Shamika Ruklan JAYASUNDARA, Øystein FLEDSBERG, Øystein TORBJØRNSEN, Åge Andre KVALNES, Helge Grenager SOLHEIM
-
Patent number: 10841377Abstract: 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.Type: GrantFiled: November 26, 2018Date of Patent: November 17, 2020Assignee: Microsoft Technology Licensing, LLCInventors: Tor Kreutzer, Jan-Ove Almli Karlberg, Shamika Ruklan Jayasundara, Øystein Fledsberg, Øystein Torbjørnsen, Åge Andre Kvalnes, Helge Grenager Solheim
-
Publication number: 20200272754Abstract: 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.Type: ApplicationFiled: May 13, 2020Publication date: August 27, 2020Applicant: Microsoft Technology Licensing, LLCInventors: Tor KREUTZER, Steffen VIKEN VALVAG, Dag Steinnes EIDESEN, Amund Kronen JOHANSEN, Peter Dahle HEEN, Jan-Ove Almli KARLBERG, Jon MELING, Age KVALNES
-
Publication number: 20200169606Abstract: 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.Type: ApplicationFiled: November 26, 2018Publication date: May 28, 2020Inventors: Tor KREUTZER, Jan-Ove Almli KARLBERG, Shamika Ruklan JAYASUNDARA, Øystein FLEDSBERG, Øystein TORBJØRNSEN, Åge Andre KVALNES, Helge Grenager SOLHEIM