Patents by Inventor Louis Martin Burger
Louis Martin Burger 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: 11875386Abstract: An apparatus, method and computer program product for estimating as-a-Service (aaS) query prices in a relational database management system (RDBMS). An optimizer of the RDBMS inserts an EXPLAIN modifier into a query, wherein the EXPLAIN modifier results in the optimizer generating a summary of a query execution plan for the query that includes one or more cost estimates for the RDBMS to perform the query. A price estimate for the query is then generated based on the cost estimates, wherein the price estimate is generated using one or more configurable pricing formulae. The price estimate is merged into the summary of the query execution plan for the query. Moreover, a price guarantee may be generated for the price estimate, wherein the price guarantee is honored when the query is subsequently invoked for execution by the RDBMS.Type: GrantFiled: December 16, 2020Date of Patent: January 16, 2024Assignee: Teradata US, Inc.Inventors: Frank Roderic Vandervort, Louis Martin Burger, Douglas P. Brown
-
Patent number: 11593334Abstract: An apparatus, method and computer program product for physical database design and tuning in relational database management systems. A relational database management system executes in a computer system, wherein the relational database management system manages a relational database comprised of one or more tables storing data. A Deep Reinforcement Learning based feedback loop process also executes in the computer system for recommending one or more tuning actions for the physical database design and tuning of the relational database management system, wherein the Deep Reinforcement Learning based feedback loop process uses a neural network framework to select the tuning actions based on one or more query workloads performed by the relational database management system.Type: GrantFiled: December 27, 2019Date of Patent: February 28, 2023Assignee: Teradata US, Inc.Inventors: Louis Martin Burger, Emiran Curtmola, Sanjay Nair, Frank Roderic Vandervort, Douglas P. Brown
-
Publication number: 20210406967Abstract: An apparatus, method and computer program product for estimating as-a-Service (aaS) query prices in a relational database management system (RDBMS). An optimizer of the RDBMS inserts an EXPLAIN modifier into a query, wherein the EXPLAIN modifier results in the optimizer generating a summary of a query execution plan for the query that includes one or more cost estimates for the RDBMS to perform the query. A price estimate for the query is then generated based on the cost estimates, wherein the price estimate is generated using one or more configurable pricing formulae. The price estimate is merged into the summary of the query execution plan for the query. Moreover, a price guarantee may be generated for the price estimate, wherein the price guarantee is honored when the query is subsequently invoked for execution by the RDBMS.Type: ApplicationFiled: December 16, 2020Publication date: December 30, 2021Applicant: Teradata US, Inc.Inventors: Frank Roderic Vandervort, Louis Martin Burger, Douglas P. Brown
-
Patent number: 10970295Abstract: A system and method for determining optimal query plans within a distributed processing system. The system includes a query optimizer for receiving a query and generating a query plan for execution by the distributed processing system; a repository including statistics related to prior executed query plans; a plan execution engine for receiving and executing the query plan, collecting statistics corresponding to the query plan, and storing the statistics and optimizer usage metadata corresponding to the query plan and prior executed query plans in the repository. The system further includes a statistics advisory tool for mining the metadata to generate a collection of histogram statistics and storing said histogram statistics in the repository. When generating a query plan, the query optimizer searches the statistics repository for statistics, including histogram statistics, useful to the generation of the current query plan and uses selected statistics from the repository to generate the query plan.Type: GrantFiled: September 6, 2016Date of Patent: April 6, 2021Assignee: Teradata US, Inc.Inventor: Louis Martin Burger
-
Publication number: 20210034588Abstract: An apparatus, method and computer program product for physical database design and tuning in relational database management systems. A relational database management system executes in a computer system, wherein the relational database management system manages a relational database comprised of one or more tables storing data. A Deep Reinforcement Learning based feedback loop process also executes in the computer system for recommending one or more tuning actions for the physical database design and tuning of the relational database management system, wherein the Deep Reinforcement Learning based feedback loop process uses a neural network framework to select the tuning actions based on one or more query workloads performed by the relational database management system.Type: ApplicationFiled: December 27, 2019Publication date: February 4, 2021Applicant: Teradata US, Inc.Inventors: Louis Martin Burger, Emiran Curtmola, Sanjay Nair, Frank Roderic Vandervort, Douglas P. Brown
-
Patent number: 10635651Abstract: Data portions of a database can be grouped and ranked in order of priory for reassignment from one or more maps to another one or more maps. It should be noted that a first map can assign the data portions to a first configuration of processors for processing the data portions, and a second map assigns the data portions to a second configuration of processors, different than the first configuration, for processing the data portions in a database system and/or environment. The data portions are reassigned in groups during an available time (window) for reassignment by taking the first one of the groups can be reassigned (“moved”) in the available, then the second one in the available reaming time, and so on, until no group of data portions can be moved in the remaining time or all of them have been moved.Type: GrantFiled: November 10, 2017Date of Patent: April 28, 2020Assignee: Teradata US, Inc.Inventors: Donald Raymond Pederson, Philip Jason Benton, Frederick S. Kaufmann, Paul Laurence Sinclair, Louis Martin Burger
-
Patent number: 10552400Abstract: Data of a database (e.g., database tables) can be reassigned from a first map to a second map in a database system that uses maps to assign data for processing to multiple processing units of a database system in accordance with one or more distributions schemes. Data portions can be selected in groups and moved in the selected groups in an efficient manner. The selection and/or movement of the data portions can be automated without requiring input for users of database systems.Type: GrantFiled: December 27, 2016Date of Patent: February 4, 2020Assignee: Teradata US, Inc.Inventors: Louis Martin Burger, Frederick S. Kaufmann
-
Patent number: 10459907Abstract: An order (or priority) for reassigning data portions of a database from a first map to a second map can be determined. It should be noted that the first map assigns the data portions to a first configuration of processors for processing the data portions, and the second map assigns the data portions to a second configuration of processors, different than the first configuration, for processing the data portions in a database system and/or environment. The order can be determined by grouping the data in multiple groups and ordering the groups in accordance with a determined priority for reassignment. In doing so, one or more relationships between the data portions and/or cost of use for each one the groups can be considered.Type: GrantFiled: October 30, 2017Date of Patent: October 29, 2019Assignee: Teradata US, Inc.Inventors: Frederick S. Kaufmann, Rajendran Kolandasamy, Philip Jason Benton, Paul Laurence Sinclair, Donald Raymond Pederson, Louis Martin Burger
-
Publication number: 20180329747Abstract: Capacity of a database system and/or a computing system that includes a database can be effectively changed from a current computing capacity to another computing capacity. This can be achieved by causing usage capacity of at least one of resource to be changed when the database is active. By way of example, capacity of a database system can be regulated by delaying the execution of the database work based on a target capacity. As a result, database work can take relatively longer to complete when the capacity of a database is effectively regulated to be below its full capacity. In effect, a portion of available capacity (excess capacity) can be made inaccessible to the database. However, excess capacity can be used to manage various services of the database in accordance with one or more service criteria (e.g., Service Level Goals or Agreements).Type: ApplicationFiled: July 24, 2018Publication date: November 15, 2018Applicant: Teradata US, Inc.Inventors: Douglas P. Brown, Thomas Patrick Julien, Anita Richards, Louis Martin Burger
-
Publication number: 20180067977Abstract: Data portions of a database can be grouped and ranked in order of priory for reassignment from one or more maps to another one or more maps. It should be noted that a first map can assign the data portions to a first configuration of processors for processing the data portions, and a second map assigns the data portions to a second configuration of processors, different than the first configuration, for processing the data portions in a database system and/or environment. The data portions are reassigned in groups during an available time (window) for reassignment by taking the first one of the groups can be reassigned (“moved”) in the available, then the second one in the available reaming time, and so on, until no group of data portions can be moved in the remaining time or all of them have been moved.Type: ApplicationFiled: November 10, 2017Publication date: March 8, 2018Applicant: Teradata US, Inc.Inventors: Donald Raymond Pederson, Philip Jason Benton, Frederick S. Kaufmann, Paul Laurence Sinclair, Louis Martin Burger
-
Publication number: 20180052877Abstract: An order (or priority) for reassigning data portions of a database from a first map to a second map can be determined. It should be noted that the first map assigns the data portions to a first configuration of processors for processing the data portions, and the second map assigns the data portions to a second configuration of processors, different than the first configuration, for processing the data portions in a database system and/or environment. The order can be determined by grouping the data in multiple groups and ordering the groups in accordance with a determined priority for reassignment In doing so, one or more relationships between the data portions and/or cost of use for each one the groups can be considered.Type: ApplicationFiled: October 30, 2017Publication date: February 22, 2018Applicant: Teradata US, Inc.Inventors: Frederick S. Kaufmann, Rajendran Kolandasamy, Philip Jason Benton, Paul Laurence Sinclair, Donald Raymond Pederson, Louis Martin Burger
-
Publication number: 20170177642Abstract: Data of a database (e.g., database tables) can be reassigned from a first map to a second map in a database system that uses maps to assign data for processing to multiple processing units of a database system in accordance with one or more distributions schemes. Data portions can be selected in groups and moved in the selected groups in an efficient manner. The selection and/or movement of the data portions can be automated without requiring input for users of database systems.Type: ApplicationFiled: December 27, 2016Publication date: June 22, 2017Applicant: Teradata US, IncInventors: Louis Martin Burger, Frederick S. Kaufmann
-
Publication number: 20170068710Abstract: A system and method for determining optimal query plans within a distributed processing system. The system includes a query optimizer for receiving a query and generating a query plan for execution by the distributed processing system; a repository including statistics related to prior executed query plans; a plan execution engine for receiving and executing the query plan, collecting statistics corresponding to the query plan, and storing the statistics and optimizer usage metadata corresponding to the query plan and prior executed query plans in the repository. The system further includes a statistics advisory tool for mining the metadata to generate a collection of histogram statistics and storing said histogram statistics in the repository. When generating a query plan, the query optimizer searches the statistics repository for statistics, including histogram statistics, useful to the generation of the current query plan and uses selected statistics from the repository to generate the query plan.Type: ApplicationFiled: September 6, 2016Publication date: March 9, 2017Applicant: Teradata US, Inc.Inventor: Louis Martin Burger
-
Patent number: 8280869Abstract: A temporary computer-stored first-unit intermediate result is generated while executing a first unit of work on a computer-based database management system. The first-unit intermediate result has properties. It is determined that the properties of the first-unit intermediate result are similar to properties of a second-unit intermediate result to be generated for a second unit of work when the second unit of work is executed on the computer-based database management system. In response, the first-unit intermediate result is saved for use in executing the second unit of work.Type: GrantFiled: July 10, 2009Date of Patent: October 2, 2012Assignee: Teradata US, Inc.Inventors: Louis Martin Burger, Thomas Patrick Julien, Douglas P. Brown, Jeffrey S. Shelton
-
Patent number: 8037057Abstract: In an example embodiment, a method is illustrated to determine multi-column indexes, the method including receiving one or more structured query language (SQL) queries, the one or more SQL queries defining a workload. A database index analysis tool may be used to determine a plurality of index configurations for executing the workload. Further, leading index configurations may be determined, leading index configurations including a subset of the plurality of index configurations. Also, a statistics database may be updated with complete statistics for the leading index configurations.Type: GrantFiled: January 7, 2009Date of Patent: October 11, 2011Assignee: Teradata US, Inc.Inventor: Louis Martin Burger
-
Publication number: 20100174701Abstract: In an example embodiment, a method is illustrated to determine multi-column indexes, the method including receiving one or more structured query language (SQL) queries, the one or more SQL queries defining a workload. A database index analysis tool may be used to determine a plurality of index configurations for executing the workload. Further, leading index configurations may be determined, leading index configurations including a subset of the plurality of index configurations. Also, a statistics database may be updated with complete statistics for the leading index configurations.Type: ApplicationFiled: January 7, 2009Publication date: July 8, 2010Inventor: Louis Martin Burger