Patents by Inventor Stefan Kaestle
Stefan Kaestle 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: 20250094443Abstract: Adaptive data collections may include various type of data arrays, sets, bags, maps, and other data structures. A simple interface for each adaptive collection may provide access via a unified API to adaptive implementations of the collection. A single adaptive data collection may include multiple, different adaptive implementations. A system configured to implement adaptive data collections may include the ability to adaptively select between various implementations, either manually or automatically, and to map a given workload to differing hardware configurations. Additionally, hardware resource needs of different configurations may be predicted from a small number of workload measurements. Adaptive data collections may provide language interoperability, such as by leveraging runtime compilation to build adaptive data collections and to compile and optimize implementation code and user code together.Type: ApplicationFiled: November 25, 2024Publication date: March 20, 2025Inventors: Iraklis Psaroudakis, Stefan Kaestle, Daniel J. Goodman, Jean-Pierre Lozi, Matthias Grimmer, Timothy L. Harris
-
Patent number: 12189652Abstract: Adaptive data collections may include various type of data arrays, sets, bags, maps, and other data structures. A simple interface for each adaptive collection may provide access via a unified API to adaptive implementations of the collection. A single adaptive data collection may include multiple, different adaptive implementations. A system configured to implement adaptive data collections may include the ability to adaptively select between various implementations, either manually or automatically, and to map a given workload to differing hardware configurations. Additionally, hardware resource needs of different configurations may be predicted from a small number of workload measurements. Adaptive data collections may provide language interoperability, such as by leveraging runtime compilation to build adaptive data collections and to compile and optimize implementation code and user code together.Type: GrantFiled: February 24, 2023Date of Patent: January 7, 2025Assignee: Oracle International CorporationInventors: Iraklis Psaroudakis, Stefan Kaestle, Daniel J. Goodman, Jean-Pierre Lozi, Matthias Grimmer, Timothy L. Harris
-
Publication number: 20230214407Abstract: Adaptive data collections may include various type of data arrays, sets, bags, maps, and other data structures. A simple interface for each adaptive collection may provide access via a unified API to adaptive implementations of the collection. A single adaptive data collection may include multiple, different adaptive implementations. A system configured to implement adaptive data collections may include the ability to adaptively select between various implementations, either manually or automatically, and to map a given workload to differing hardware configurations. Additionally, hardware resource needs of different configurations may be predicted from a small number of workload measurements. Adaptive data collections may provide language interoperability, such as by leveraging runtime compilation to build adaptive data collections and to compile and optimize implementation code and user code together.Type: ApplicationFiled: February 24, 2023Publication date: July 6, 2023Inventors: Iraklis Psaroudakis, Stefan Kaestle, Daniel J. Goodman, Jean-Pierre Lozi, Matthias Grimmer, Timothy L. Harris
-
Patent number: 11593398Abstract: Adaptive data collections may include various type of data arrays, sets, bags, maps, and other data structures. A simple interface for each adaptive collection may provide access via a unified API to adaptive implementations of the collection. A single adaptive data collection may include multiple, different adaptive implementations. A system configured to implement adaptive data collections may include the ability to adaptively select between various implementations, either manually or automatically, and to map a given workload to differing hardware configurations. Additionally, hardware resource needs of different configurations may be predicted from a small number of workload measurements. Adaptive data collections may provide language interoperability, such as by leveraging runtime compilation to build adaptive data collections and to compile and optimize implementation code and user code together.Type: GrantFiled: October 9, 2020Date of Patent: February 28, 2023Assignee: Oracle International CorporationInventors: Iraklis Psaroudakis, Stefan Kaestle, Daniel J. Goodman, Jean-Pierre Lozi, Matthias Grimmer, Timothy L. Harris
-
Patent number: 10990595Abstract: Techniques are described herein for asynchronous execution of queries on statically replicated graph data. In an embodiment, a graph is partitioned among a plurality of computers executing the graph querying engine. One or more high-degree vertices of the graph are each replicated in each graph partition. The partitions, including the replicated high-degree vertices, are loaded in memory of the plurality of computers. To execute a query, a query plan is generated based on the query. The query plan specifies a plurality of operators and an order for the plurality of operators. The order is such that if an operator requires data generated by another operator, then the other operator is ordered before the operator in the query plan. Replicated copies of a vertex is visited if matches made by subsequent operator(s) are limited by data unique to the replicated vertices.Type: GrantFiled: February 12, 2019Date of Patent: April 27, 2021Assignee: Oracle International CorporationInventors: Nicholas Roth, Sungpack Hong, Petr Koupy, Jinsu Lee, Vasileios Trigonakis, Abderrahmane Melhaoui, Stefan Kaestle
-
Publication number: 20210042323Abstract: Adaptive data collections may include various type of data arrays, sets, bags, maps, and other data structures. A simple interface for each adaptive collection may provide access via a unified API to adaptive implementations of the collection. A single adaptive data collection may include multiple, different adaptive implementations. A system configured to implement adaptive data collections may include the ability to adaptively select between various implementations, either manually or automatically, and to map a given workload to differing hardware configurations. Additionally, hardware resource needs of different configurations may be predicted from a small number of workload measurements. Adaptive data collections may provide language interoperability, such as by leveraging runtime compilation to build adaptive data collections and to compile and optimize implementation code and user code together.Type: ApplicationFiled: October 9, 2020Publication date: February 11, 2021Inventors: Iraklis Psaroudakis, Stefan Kaestle, Daniel J. Goodman, Jean-Pierre Lozi, Matthias Grimmer, Timothy L. Harris
-
Patent number: 10803087Abstract: Adaptive data collections may include various type of data arrays, sets, bags, maps, and other data structures. A simple interface for each adaptive collection may provide access via a unified API to adaptive implementations of the collection. A single adaptive data collection may include multiple, different adaptive implementations. A system configured to implement adaptive data collections may include the ability to adaptively select between various implementations, either manually or automatically, and to map a given workload to differing hardware configurations. Additionally, hardware resource needs of different configurations may be predicted from a small number of workload measurements. Adaptive data collections may provide language interoperability, such as by leveraging runtime compilation to build adaptive data collections and to compile and optimize implementation code and user code together.Type: GrantFiled: October 19, 2018Date of Patent: October 13, 2020Assignee: Oracle International CorporationInventors: Iraklis Psaroudakis, Stefan Kaestle, Daniel J. Goodman, Jean-Pierre Lozi, Matthias Grimmer, Timothy L. Harris
-
Publication number: 20200125668Abstract: Adaptive data collections may include various type of data arrays, sets, bags, maps, and other data structures. A simple interface for each adaptive collection may provide access via a unified API to adaptive implementations of the collection. A single adaptive data collection may include multiple, different adaptive implementations. A system configured to implement adaptive data collections may include the ability to adaptively select between various implementations, either manually or automatically, and to map a given workload to differing hardware configurations. Additionally, hardware resource needs of different configurations may be predicted from a small number of workload measurements. Adaptive data collections may provide language interoperability, such as by leveraging runtime compilation to build adaptive data collections and to compile and optimize implementation code and user code together.Type: ApplicationFiled: October 19, 2018Publication date: April 23, 2020Inventors: Iraklis Psaroudakis, Stefan Kaestle, Daniel J. Goodman, Jean-Pierre Lozi, Matthias Grimmer, Timothy L. Harris
-
Publication number: 20190354526Abstract: Techniques are described herein for asynchronous execution of queries on statically replicated graph data. In an embodiment, a graph is partitioned among a plurality of computers executing the graph querying engine. One or more high-degree vertices of the graph are each replicated in each graph partition. The partitions, including the replicated high-degree vertices, are loaded in memory of the plurality of computers. To execute a query, a query plan is generated based on the query. The query plan specifies a plurality of operators and an order for the plurality of operators. The order is such that if an operator requires data generated by another operator, then the other operator is ordered before the operator in the query plan. Replicated copies of a vertex is visited if matches made by subsequent operator(s) are limited by data unique to the replicated vertices.Type: ApplicationFiled: February 12, 2019Publication date: November 21, 2019Inventors: Nicholas Roth, Sungpack Hong, Petr Koupy, Jinsu Lee, Vasileios Trigonakis, Abderrahmane Melhaoui, Stefan Kaestle