Patents by Inventor Peter Dahle Heen
Peter Dahle Heen 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).
-
Patent number: 11748506Abstract: 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 2, 2022Date of Patent: September 5, 2023Assignee: 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: 20230004559Abstract: 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.Type: ApplicationFiled: September 9, 2022Publication date: January 5, 2023Applicant: Microsoft Technology Licensing, LLCInventors: Tor KREUTZER, Amund Kronen JOHANSEN, Steffen Viken VALVÅG, Åge KVALNES, Dag EIDESEN, Peter Dahle HEEN, Jan-Ove KARLBERG, Daniele VETTOREL
-
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
-
Patent number: 11461318Abstract: 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.Type: GrantFiled: February 28, 2017Date of Patent: October 4, 2022Assignee: Microsoft Technology Licensing, LLCInventors: Tor Kreutzer, Amund Kronen Johansen, Steffen Viken Valvåg, Åge Kvalnes, Dag Eidesen, Peter Dahle Heen, Jan-Ove Karlberg, Daniele Vettorel
-
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: 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
-
Patent number: 10657282Abstract: 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: February 6, 2019Date of Patent: May 19, 2020Assignee: 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
-
Patent number: 10545945Abstract: Approximate Membership Query (AMQ) Filters are used in conjunction with graph queries to a relational graph to provide change monitoring that span views associated with the queries. Each node from the relational graph spanned by a graph query and the index structure for the view are added as members to an AMQ filter. When a change is made to the relational graph, the changed nodes are queried against the AMQ filter. When a changed node is noted as a candidate member of the AMQ filter, the graph query may be rerun to update the view associated with the query. Otherwise, the graph query is not rerun, thus saving computing resources and improving the systems hosting and querying the relational graph.Type: GrantFiled: October 28, 2016Date of Patent: January 28, 2020Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Peter Dahle Heen, Dag Steinnes Eidesen, Amund Kronen Johansen, Dag Brattli, Jan-Ove Almli Karlberg, Tor Kreutzer, Åge Kvalnes, Steffen Viken Valvåg
-
Patent number: 10445361Abstract: Systems, methods, and computer readable devices embodying instructions are provided herein for reducing latencies and/or improving computational efficiency when traversing data stored in a relational graph by caching subgraphs and enabling the utilization thereof. More specifically, after a user performs a graph query, the resulting subgraphs of the graph query are cached in a reusable form. Subsequent graph queries are able to identify cached subgraphs based on the graph query. Further, the subsequent graph query is operable to integrate the cached subgraphs as part of the result of subsequent graph query, which may include a portion or the entire result of the subsequent graph query being composed from cached subgraphs, thereby improving the computational efficiency and performance of querying relational graphs, reducing the query execution cost required to traverse the relational graphs, and improving the functionality of the computing devices hosting the relational graphs and running the queries.Type: GrantFiled: January 6, 2017Date of Patent: October 15, 2019Assignee: MICROSOFT TECHNOLOGY LICENSING, LLCInventors: Tor Kreutzer, Åge Kvalnes, Steffen Viken Valvåg, Amund Kronen Johansen, Dag Steinnes Eidesen, Peter Dahle Heen, Jan-Ove Almli Karlberg
-
Patent number: 10402403Abstract: Traversing data stored in a relational graph by utilization of probabilistic characteristics associated with the graph nodes is disclosed. When a user submits a request with a graph query, an initial node associated with the graph query is identified. Further, the edge type associated the node is extracted from the graph query. When traversing the graph by following relevant edges from the initial node to new nodes, each new node is queried with the extracted edge type. If the query for the node is negative, then the edges for the particular node are not enumerated. However, if the query for the node is positive, then the edges for the particular node are enumerated for expanding the subgraph. This process continues until the subgraph is expanded to include all relevant nodes. Thus, the computational efficiency is improved by reducing the number of edges that must be traversed when performing graph queries.Type: GrantFiled: January 6, 2017Date of Patent: September 3, 2019Assignee: Microsoft Technology Licensing, LLCInventors: Steffen Viken Valvåg, Amund Kronen Johansen, Dag Steinnes Eidesen, Åge Kvalnes, Tor Kreutzer, Jan-Ove Almli Karlberg, Peter Dahle Heen
-
Publication number: 20190171840Abstract: 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: February 6, 2019Publication date: June 6, 2019Applicant: 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
-
Patent number: 10242223Abstract: 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: February 27, 2017Date of Patent: March 26, 2019Assignee: 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: 20180246929Abstract: 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.Type: ApplicationFiled: February 28, 2017Publication date: August 30, 2018Applicant: Microsoft Technology Licensing, LLCInventors: Tor Kreutzer, Amund Kronen Johansen, Steffen Viken Valvåg, Åge Kvalnes, Dag Eidesen, Peter Dahle Heen, Jan-Ove Karlberg, Daniele Vettorel
-
Publication number: 20180247073Abstract: 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: February 27, 2017Publication date: August 30, 2018Applicant: 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: 20180173727Abstract: Systems, methods, and computer readable devices embodying instructions are provided herein for reducing latencies and/or improving computational efficiency when traversing data stored in a relational graph by caching subgraphs and enabling the utilization thereof. More specifically, after a user performs a graph query, the resulting subgraphs of the graph query are cached in a reusable form. Subsequent graph queries are able to identify cached subgraphs based on the graph query. Further, the subsequent graph query is operable to integrate the cached subgraphs as part of the result of subsequent graph query, which may include a portion or the entire result of the subsequent graph query being composed from cached subgraphs, thereby improving the computational efficiency and performance of querying relational graphs, reducing the query execution cost required to traverse the relational graphs, and improving the functionality of the computing devices hosting the relational graphs and running the queries.Type: ApplicationFiled: January 6, 2017Publication date: June 21, 2018Applicant: Microsoft Technology Licensing, LLCInventors: Tor Kreutzer, Åge Kvalnes, Steffen Viken Valvåg, Amund Kronen Johansen, Dag Steinnes Eidesen, Peter Dahle Heen, Jan-Ove Almli Karlberg
-
Publication number: 20180173760Abstract: Traversing data stored in a relational graph by utilization of probabilistic characteristics associated with the graph nodes is disclosed. When a user submits a request with a graph query, an initial node associated with the graph query is identified. Further, the edge type associated the node is extracted from the graph query. When traversing the graph by following relevant edges from the initial node to new nodes, each new node is queried with the extracted edge type. If the query for the node is negative, then the edges for the particular node are not enumerated. However, if the query for the node is positive, then the edges for the particular node are enumerated for expanding the subgraph. This process continues until the subgraph is expanded to include all relevant nodes. Thus, the computational efficiency is improved by reducing the number of edges that must be traversed when performing graph queries.Type: ApplicationFiled: January 6, 2017Publication date: June 21, 2018Applicant: Microsoft Technology Licensing, LLCInventors: Steffen Viken Valvåg, Amund Kronen Johansen, Dag Steinnes Eidesen, Åge Kvalnes, Tor Kreutzer, Jan-Ove Almli Karlberg, Peter Dahle Heen
-
Publication number: 20180121482Abstract: Approximate Membership Query (AMQ) Filters are used in conjunction with graph queries to a relational graph to provide change monitoring that span views associated with the queries. Each node from the relational graph spanned by a graph query and the index structure for the view are added as members to an AMQ filter. When a change is made to the relational graph, the changed nodes are queried against the AMQ filter. When a changed node is noted as a candidate member of the AMQ filter, the graph query may be rerun to update the view associated with the query. Otherwise, the graph query is not rerun, thus saving computing resources and improving the systems hosting and querying the relational graph.Type: ApplicationFiled: October 28, 2016Publication date: May 3, 2018Applicant: Microsoft Technology Licensing, LLC.Inventors: Peter Dahle Heen, Dag Steinnes Eidesen, Amund Kronen Johansen, Dag Brattli, Jan-Ove Almli Karlberg, Tor Kreutzer, Åge Kvalnes, Steffen Viken Valvåg