Patents by Inventor Donald Raymond Pederson

Donald Raymond Pederson 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: 11086903
    Abstract: A data-changing request is received on a first data source system. Metadata for a data source object associated with the request is obtained. The request is executed on a second data source system and results are obtained. A selection between multiple replication processes is made based on the metadata and the results. The selected process is performed on each of the remaining data source systems to synchronize/replicate data changes on the remaining data source systems. In an embodiment, bidirectional and concurrent data connections are permitted to a source object for one data source system and a replicated version of the source object on a different source system. In an embodiment, each data source system includes an agent that establishes an out-of-band connection to a synchronization/replication server, such that synchronization/replication is processed by the server without an affirmative connection being made from the data source systems to the server.
    Type: Grant
    Filed: June 28, 2019
    Date of Patent: August 10, 2021
    Assignee: Teradata US, Inc.
    Inventors: Gregory Paul Ferguson, David Tung, Stanley S Chiu, Donald Raymond Pederson
  • Patent number: 11023469
    Abstract: A database includes a Value List Compression (VLC) predicate evaluator. A table identified in a query that is being processed is identified as having compressed data values. The predicate evaluator compares a query predicate of the query against actual decompressed values noted in a dictionary for the table and the predicate evaluator maintains a bitmap for selective ones of the actual values that satisfy the query predicate. The matched bitmap positions are processed against an index maintained in the table for the actual values to provide selective decompressed table entries as results for the query.
    Type: Grant
    Filed: November 29, 2017
    Date of Patent: June 1, 2021
    Assignee: Teradata US, Inc.
    Inventors: Bhashyam Ramesh, Tirupathi Prabhu Bellapukonda, Philip Jason Benton, Donald Raymond Pederson
  • Publication number: 20210034477
    Abstract: In some examples, a system sends a transaction to a database server to cause storing of data of the transaction in a cache of the database server, where the data in the cache is for inclusion in a backup of data from the database server to a remote data store (e.g., the backup may be in a cloud and may be a snapshot). The system detects a failure associated with the database server, and in response to detecting the failure, requests, from the database server or a replacement database server, transaction information of at least one transaction that was successfully applied to the remote data store, the transaction information based on the backup of data. The system causes replay one or more transactions to recover data at the database server or the replacement database server, to perform recovery of the database server or the replacement database server to a current state.
    Type: Application
    Filed: December 19, 2019
    Publication date: February 4, 2021
    Inventor: Donald Raymond Pederson
  • Patent number: 10891290
    Abstract: Search spaces for obtaining query execution plans for a query are identified. The search spaces are subdivided into sub-search spaces. Searches are initiated within the sub search spaces and plan costs for competing query execution plans are noted along with search costs associated with continuing to search the sub-search spaces. A decision is made based on the plan costs and search costs for utilizing search resources as to when to terminate the searching and to select the then-existing lowest cost query execution plan as an optimal query execution plan for executing the query.
    Type: Grant
    Filed: December 22, 2017
    Date of Patent: January 12, 2021
    Assignee: Teradata US, Inc.
    Inventors: John Mark Morris, Bhashyam Ramesh, Donald Raymond Pederson, Kuorong Chiang
  • Patent number: 10776229
    Abstract: Database processing engines of a single cluster are configured such that each engine is a primary engine and a dedicated fallback engine to one other engine of the cluster. In an embodiment, the cluster includes more than two processing engines.
    Type: Grant
    Filed: December 22, 2017
    Date of Patent: September 15, 2020
    Assignee: Teradata US, Inc.
    Inventors: Tirunagari Venkata Rama Krishna, Srinath Boppudi, Frederick Stuart Kaufmann, Donald Raymond Pederson
  • Publication number: 20200201680
    Abstract: A database system comprises a plurality of processing modules arranged to process data objects from a plurality of data object servers based upon a database query from a client computer system. A control task module is arranged to iteratively dynamically assign data objects from the plurality of data object servers to each of the plurality of processing modules based upon processing activity associated with the processing module during the database query from the client computer system. Alternatively, or in addition to, the control task module is arranged to iteratively dynamically assign data objects from the plurality of data object servers to each of the plurality of processing modules based upon a characteristic of the data objects to be dynamically assigned to the processing module during the database query from the client computer system.
    Type: Application
    Filed: December 19, 2018
    Publication date: June 25, 2020
    Applicant: Teradata US, Inc.
    Inventors: Michael Warren Watzke, Steven B. Cohen, Donald Raymond Pederson
  • Patent number: 10635651
    Abstract: 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: Grant
    Filed: November 10, 2017
    Date of Patent: April 28, 2020
    Assignee: Teradata US, Inc.
    Inventors: Donald Raymond Pederson, Philip Jason Benton, Frederick S. Kaufmann, Paul Laurence Sinclair, Louis Martin Burger
  • Publication number: 20200110748
    Abstract: A query that is frequently processed to access an object storage is identified. Results from the query returned from the object storage is transformed into a relational database format as a materialized view. When the query is submitted a subsequent time, updated results are managed from the materialized view, other materialized views, and/or the object storage when needed.
    Type: Application
    Filed: December 28, 2018
    Publication date: April 9, 2020
    Inventors: Michael Warren Watzke, Steven B. Cohen, Donald Raymond Pederson
  • Publication number: 20200110757
    Abstract: An Application Programming Interface (API) processes object storage requests in an object storage format that are received from client applications. A mapper maps the object storage formatted requests into database statements and executes the statements within a database management system. Results returned from the statements are mapped by the mapper to object-storage constructs and provided to the API in object storage format. The object storage formatted requests are provided from the API to the client applications to satisfy the original client applications' requests.
    Type: Application
    Filed: December 28, 2018
    Publication date: April 9, 2020
    Inventors: Awny Al-Omari, Louis Benton Landry, Stephen Andrew Brobst, Donald Raymond Pederson, Todd Walter, Oliver Ratzesberger
  • Publication number: 20200004758
    Abstract: A data-changing request is received on a first data source system. Metadata for a data source object associated with the request is obtained. The request is executed on a second data source system and results are obtained. A selection between multiple replication processes is made based on the metadata and the results. The selected process is performed on each of the remaining data source systems to synchronize/replicate data changes on the remaining data source systems. In an embodiment, bidirectional and concurrent data connections are permitted to a source object for one data source system and a replicated version of the source object on a different source system. In an embodiment, each data source system includes an agent that establishes an out-of-band connection to a synchronization/replication server, such that synchronization/replication is processed by the server without an affirmative connection being made from the data source systems to the server.
    Type: Application
    Filed: June 28, 2019
    Publication date: January 2, 2020
    Inventors: Gregory Paul Ferguson, David Tung, Stanley S. Chiu, Donald Raymond Pederson
  • Patent number: 10459907
    Abstract: 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: Grant
    Filed: October 30, 2017
    Date of Patent: October 29, 2019
    Assignee: Teradata US, Inc.
    Inventors: Frederick S. Kaufmann, Rajendran Kolandasamy, Philip Jason Benton, Paul Laurence Sinclair, Donald Raymond Pederson, Louis Martin Burger
  • Patent number: 10366057
    Abstract: Data or one or more operations can be provided, based on one or more characteristics associated with the data and/or operations, to a designated computing group or pool of computing resources designated for handling the data and/or operations with the particular data characteristic(s). The designated computing group can, for example, be one of multiple computing groups in the same system or device. As such, all of the computing groups can still function together in the same system or device, for example, in parallel. However, each one of the multiple computing groups can, for example, be defined or predefined to include one or more computing resources that are more suitable for storing and/or processing data with one or more data characteristics or handle operations with one or more determined characteristics.
    Type: Grant
    Filed: May 24, 2013
    Date of Patent: July 30, 2019
    Assignee: Teradata US, Inc.
    Inventors: John Mark Morris, Donald Raymond Pederson, Douglas P. Brown
  • Publication number: 20190197163
    Abstract: Search spaces for obtaining query execution plans for a query are identified. The search spaces are subdivided into sub-search spaces. Searches are initiated within the sub search spaces and plan costs for competing query execution plans are noted along with search costs associated with continuing to search the sub-search spaces. A decision is made based on the plan costs and search costs for utilizing search resources as to when to terminate the searching and to select the then-existing lowest cost query execution plan as an optimal query execution plan for executing the query.
    Type: Application
    Filed: December 22, 2017
    Publication date: June 27, 2019
    Inventors: John Mark Morris, Bhashyam Ramesh, Donald Raymond Pederson, Kuorong Chiang
  • Publication number: 20190196923
    Abstract: Database processing engines of a single cluster are configured such that each engine is a primary engine and a dedicated fallback engine to one other engine of the cluster. In an embodiment, the cluster includes more than two processing engines.
    Type: Application
    Filed: December 22, 2017
    Publication date: June 27, 2019
    Inventors: Tirunagari Venkata Rama Krishna, Srinath Boppudi, Frederick Stuart Kaufmann, Donald Raymond Pederson
  • Publication number: 20190163788
    Abstract: A database includes a Value List Compression (VLC) predicate evaluator. A table identified in a query that is being processed is identified as having compressed data values. The predicate evaluator compares a query predicate of the query against actual decompressed values noted in a dictionary for the table and the predicate evaluator maintains a bitmap for selective ones of the actual values that satisfy the query predicate. The matched bitmap positions are processed against an index maintained in the table for the actual values to provide selective decompressed table entries as results for the query.
    Type: Application
    Filed: November 29, 2017
    Publication date: May 30, 2019
    Inventors: Bhashyam Ramesh, Tirupathi Prabhu Bellapukonda, Philip Jason Benton, Donald Raymond Pederson
  • Publication number: 20180067977
    Abstract: 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: Application
    Filed: November 10, 2017
    Publication date: March 8, 2018
    Applicant: Teradata US, Inc.
    Inventors: Donald Raymond Pederson, Philip Jason Benton, Frederick S. Kaufmann, Paul Laurence Sinclair, Louis Martin Burger
  • Publication number: 20180052877
    Abstract: 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: Application
    Filed: October 30, 2017
    Publication date: February 22, 2018
    Applicant: Teradata US, Inc.
    Inventors: Frederick S. Kaufmann, Rajendran Kolandasamy, Philip Jason Benton, Paul Laurence Sinclair, Donald Raymond Pederson, Louis Martin Burger
  • Publication number: 20140188884
    Abstract: Data or one or more operations can be provided, based on one or more characteristics associated with the data and/or operations, to a designated computing group or pool of computing resources designated for handling the data and/or operations with the particular data characteristic(s). The designated computing group can, for example, be one of multiple computing groups in the same system or device. As such, all of the computing groups can still function together in the same system or device, for example, in parallel. However, each one of the multiple computing groups can, for example, be defined or predefined to include one or more computing resources that are more suitable for storing and/or processing data with one or more data characteristics or handle operations with one or more determined characteristics.
    Type: Application
    Filed: May 24, 2013
    Publication date: July 3, 2014
    Applicant: Teradata Corporation
    Inventors: John Mark Morris, Donald Raymond Pederson, Douglas P. Brown
  • Patent number: 7877372
    Abstract: A method, computer program, and database system are disclosed for querying tables stored on multiple processing modules. The method includes specifying module group characteristics. A plurality of modules corresponding to the module group characteristics are then identified. The identified modules are sampled for statistics concerning at least one table specified in a query. An execution plan for the query is optimized based at least in part on the sampled statistics.
    Type: Grant
    Filed: May 24, 2004
    Date of Patent: January 25, 2011
    Assignee: Teradata US, Inc.
    Inventors: Arthur Vargas Lopes, Jerry Lynn Klindt, Kuorong Chiang, Donald Raymond Pederson, Pradeep Sathyanarayan
  • Patent number: 7152026
    Abstract: A method for executing database transactions is disclosed. A plurality of interconnected nodes are each defined in terms of processor and storage resources of a parallel computing system. A first set of virtual processors is mapped across a first subset of the nodes to create a first map with at least one virtual processor being mapped to each node in the first subset. A second set of virtual processors is mapped across a second subset of the nodes to create a second map with at least one virtual processor being mapped to each node in the second subset. The first map is stored as a first configuration and the second map is stored as a second configuration. At least one transaction is executed using the first set of virtual processors and simultaneously at least one transaction is executed using the second set of virtual processors.
    Type: Grant
    Filed: December 7, 2001
    Date of Patent: December 19, 2006
    Assignee: NCR Corp.
    Inventors: John Earl Merritt, Donald Raymond Pederson, Eric Thomas Potter