Patents by Inventor Kai-Uwe Sattler
Kai-Uwe Sattler 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: 11789951Abstract: A method, a system, and a computer program product for placement or storage of data structures in memory/storage locations. A type of a data structure for storing data and a type of data access to the data structure are determined. The type of data access includes a first and a second type of data access. A frequency of each type of access to each type of data structure accessed by a query is determined. Using the determined frequency, a number of first type of data accesses to the data structure is compared to a number of second type of accesses to the data structure. The numbers of first and second types of data access are compared to a predetermined threshold percentage of a total number of data accesses to the data structure. Based on the comparisons, a physical memory location for storing data is determined.Type: GrantFiled: September 7, 2021Date of Patent: October 17, 2023Assignee: SAP SEInventors: Robert Lasch, Thomas Legler, Robert Schulze, Kai-Uwe Sattler
-
Patent number: 11580106Abstract: A method may include responding to a query to retrieve data from a database by identifying a plurality of query execution plans. An overall robustness value may be determined for each query execution plan. The overall robustness value of a query execution plan may correspond to a sum of individual robustness values for each operator included in the query execution plan. Each operator may have an individual robustness value that corresponds to a first change in a total cost of a query execution plan including the operator relative to a second change in an output cardinality of the operator. One of the plurality of query execution plans may be selected based on the overall robustness value of each of the plurality of query execution plans. The query may be executed by performing a sequence of operators included in the selected one of the plurality of query execution plan.Type: GrantFiled: November 17, 2021Date of Patent: February 14, 2023Assignee: SAP SEInventors: Florian Wolf, Michael Brendle, Norman May, Paul Willems, Kai-Uwe Sattler
-
Publication number: 20220405288Abstract: A method, a system, and a computer program product for placement or storage of data structures in memory/storage locations. A type of a data structure for storing data and a type of data access to the data structure are determined. The type of data access includes a first and a second type of data access. A frequency of each type of access to each type of data structure accessed by a query is determined. Using the determined frequency, a number of first type of data accesses to the data structure is compared to a number of second type of accesses to the data structure. The numbers of first and second types of data access are compared to a predetermined threshold percentage of a total number of data accesses to the data structure. Based on the comparisons, a physical memory location for storing data is determined.Type: ApplicationFiled: September 7, 2021Publication date: December 22, 2022Inventors: Robert Lasch, Thomas Legler, Robert Schulze, Kai-Uwe Sattler
-
Publication number: 20220075781Abstract: A method may include responding to a query to retrieve data from a database by identifying a plurality of query execution plans. An overall robustness value may be determined for each query execution plan. The overall robustness value of a query execution plan may correspond to a sum of individual robustness values for each operator included in the query execution plan. Each operator may have an individual robustness value that corresponds to a first change in a total cost of a query execution plan including the operator relative to a second change in an output cardinality of the operator. One of the plurality of query execution plans may be selected based on the overall robustness value of each of the plurality of query execution plans. The query may be executed by performing a sequence of operators included in the selected one of the plurality of query execution plan.Type: ApplicationFiled: November 17, 2021Publication date: March 10, 2022Inventors: Florian Wolf, Michael Brendle, Norman May, Paul Willems, Kai-Uwe Sattler
-
Patent number: 11204921Abstract: A method may include responding to a query to retrieve data from a database by identifying a plurality of query execution plans. An overall robustness value may be determined for each query execution plan. The overall robustness value of a query execution plan may correspond to a sum of individual robustness values for each operator included in the query execution plan. Each operator may have an individual robustness value that corresponds to a first change in a total cost of a query execution plan including the operator relative to a second change in an output cardinality of the operator. One of the plurality of query execution plans may be selected based on the overall robustness value of each of the plurality of query execution plans. The query may be executed by performing a sequence of operators included in the selected one of the plurality of query execution plan.Type: GrantFiled: May 31, 2019Date of Patent: December 21, 2021Assignee: SAP SEInventors: Florian Wolf, Michael Brendle, Norman May, Paul Willems, Kai-Uwe Sattler
-
Patent number: 11080276Abstract: In some implementations, there is provided an apparatus having at least one data processor and at least one memory storing instructions which, when executed by the at least one data processor, cause executing at least a portion of a query execution plan; determining, at an edge including an intermediate result, a cardinality; proceeding with the execution of the query execution plan, when the determined cardinality is within an optimality range associated with the edge; and selecting an alternative query execution plan for execution, when the determined cardinality is outside the optimality range associated with the edge. Related systems and articles of manufacture are also provided.Type: GrantFiled: February 23, 2018Date of Patent: August 3, 2021Assignee: SAP SEInventors: Florian Wolf, Norman May, Paul Willems, Kai-Uwe Sattler
-
Publication number: 20190370257Abstract: A method may include responding to a query to retrieve data from a database by identifying a plurality of query execution plans. An overall robustness value may be determined for each query execution plan. The overall robustness value of a query execution plan may correspond to a sum of individual robustness values for each operator included in the query execution plan. Each operator may have an individual robustness value that corresponds to a first change in a total cost of a query execution plan including the operator relative to a second change in an output cardinality of the operator. One of the plurality of query execution plans may be selected based on the overall robustness value of each of the plurality of query execution plans. The query may be executed by performing a sequence of operators included in the selected one of the plurality of query execution plan.Type: ApplicationFiled: May 31, 2019Publication date: December 5, 2019Inventors: Florian Wolf, Michael Brendle, Norman May, Paul Willems, Kai-Uwe Sattler
-
Publication number: 20190266272Abstract: In some implementations, there is provided an apparatus having at least one data processor and at least one memory storing instructions which, when executed by the at least one data processor, cause executing at least a portion of a query execution plan; determining, at an edge including an intermediate result, a cardinality; proceeding with the execution of the query execution plan, when the determined cardinality is within an optimality range associated with the edge; and selecting an alternative query execution plan for execution, when the determined cardinality is outside the optimality range associated with the edge. Related systems and articles of manufacture are also provided.Type: ApplicationFiled: February 23, 2018Publication date: August 29, 2019Inventors: Florian Wolf, Norman May, Paul Willems, Kai-Uwe Sattler
-
Patent number: 8892586Abstract: An additional data structure can be initialized for a column of compressed data to include a prefix storing, for each block of values in the column, a total number of bits set in previous blocks in the bit vector. A block number can be determined for a target block of the plurality of blocks, for example by checking whether or not a specified row number is located in the prefix. If the specified row number is located in the prefix, the prefix value of the prefix is returned, the most frequently occurring value is returned if a corresponding bit in the bit vector in the specified row number is not located in the prefix, or a position of the specified row in an index vector for the column is returned.Type: GrantFiled: December 23, 2011Date of Patent: November 18, 2014Assignee: SAP AGInventors: Christian Lemke, Tobias Mindnich, Christoph Weyerhaeuser, Franz Faerber, Kai-Uwe Sattler
-
Publication number: 20130166566Abstract: An additional data structure can be initialized for a column of compressed data to include a prefix storing, for each block of values in the column, a total number of bits set in previous blocks in the bit vector. A block number can be determined for a target block of the plurality of blocks, for example by checking whether or not a specified row number is located in the prefix. If the specified row number is located in the prefix, the prefix value of the prefix is returned, the most frequently occurring value is returned if a corresponding bit in the bit vector in the specified row number is not located in the prefix, or a position of the specified row in an index vector for the column is returned.Type: ApplicationFiled: December 23, 2011Publication date: June 27, 2013Inventors: Christian Lemke, Tobias Mindnich, Christoph Weyerhaeuser, Franz Faerber, Kai-Uwe Sattler
-
Patent number: 7962231Abstract: An apparatus for providing data for wave field synthesis rendering in a wave field synthesis system with plurality of renderer modules, at least one loudspeaker being associated with each renderer module, and the loudspeakers associated with the renderer modules being attachable at different positions in a reproduction room, includes a provider for providing a plurality of audio files, wherein a virtual source at a source position is associated with an audio file, and a data output for providing the audio file to a renderer with which an active loudspeaker is associated, with the data output further formed to not provide the audio file to a renderer if all loudspeakers associated with the renderer are not to be active for the reproduction of the source. Thus, unnecessary data transmissions in the wave field synthesis system are avoided, while making optimum use of the renderer maximum capacity in a multi-renderer system.Type: GrantFiled: August 17, 2007Date of Patent: June 14, 2011Assignees: Fraunhofer-Gesellschaft zur Foerderung der angewandten Forschung e.V., Tu IlmenauInventors: Katrin Reichelt, Gabriel Gatzsche, Thomas Heimrich, Kai-Uwe Sattler, Sandra Brix
-
Patent number: 7668611Abstract: For controlling a wave field synthesis renderer arranged in a wave field synthesis system, a scene description, in which not an absolute position or an absolute time instant, but a time span or location span within which the audio object may vary is indicated for a source, is used. Furthermore, there is provided a monitor, which monitors a utilization situation of the wave field synthesis system. An audio object manipulator finally varies the starting point of the audio object to be considered by the wave field synthesis renderer or the actual position of the audio object within the time span and/or location span, in order to avoid capacity bottlenecks on the transmission lines or in the renderer.Type: GrantFiled: August 17, 2007Date of Patent: February 23, 2010Assignee: Fraunhofer-Gesellschaft zur Foerderung der angewandten Forschung e.V.Inventors: Katrin Reichelt, Gabriel Gatzsche, Thomas Heimrich, Kai-Uwe Sattler, Sandra Brix
-
Publication number: 20080019534Abstract: An apparatus for providing data for wave field synthesis rendering in a wave field synthesis system with plurality of renderer modules, at least one loudspeaker being associated with each renderer module, and the loudspeakers associated with the renderer modules being attachable at different positions in a reproduction room, includes a provider for providing a plurality of audio files, wherein a virtual source at a source position is associated with an audio file, and a data output for providing the audio file to a renderer with which an active loudspeaker is associated, with the data output further formed to not provide the audio file to a renderer if all loudspeakers associated with the renderer are not to be active for the reproduction of the source. Thus, unnecessary data transmissions in the wave field synthesis system are avoided, while making optimum use of the renderer maximum capacity in a multi-renderer system.Type: ApplicationFiled: August 17, 2007Publication date: January 24, 2008Applicants: Fraunhofer-Gesellschaft zur Forderung der angewandten Forschung e.V., TU IlmenauInventors: Katrin REICHELT, Gabriel GATZSCHE, Thomas HEIMRICH, Kai-Uwe SATTLER, Sandra BRIX
-
Publication number: 20080008326Abstract: For controlling a wave field synthesis renderer arranged in a wave field synthesis system, a scene description, in which not an absolute position or an absolute time instant, but a time span or location span within which the audio object may vary is indicated for a source, is used. Furthermore, there is provided a monitor, which monitors a utilization situation of the wave field synthesis system. An audio object manipulator finally varies the starting point of the audio object to be considered by the wave field synthesis renderer or the actual position of the audio object within the time span and/or location span, in order to avoid capacity bottlenecks on the transmission lines or in the renderer.Type: ApplicationFiled: August 17, 2007Publication date: January 10, 2008Applicants: Fraunhofer -Gesellschaft zur Forderung der angewandten Forschung e.V., TU IlmenauInventors: Katrin REICHELT, Gabriel GATZSCHE, Thomas HEIMRICH, Kai-Uwe SATTLER, Sandra BRIX