Patents by Inventor Donald Pederson

Donald 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: 9851923
    Abstract: A combination of non-persistent-based and persistent-based schemes are used to effectively manage volatile storages which are conventionally managed solely by using non-persistent schemes (e.g., LRU schemes in cache memory). Generally, the persistent-based schemes can be based on persistent information associated with a non-volatile storage environment (e.g., persistent data temperatures associated with data stored in non-volatile storages). In this context, a persistent-based scheme can, for example, be effectively used in addition or combination with a conventional scheme provided for volatile memory. By way of example, a LRU scheme can be combined with a scheme based on persistent data temperatures in order to more effectively manage cache memory provided to enhance the performance of a system. As another example, a LRU, a LFU aging schemes can be combined with a scheme based on persistent data temperatures.
    Type: Grant
    Filed: December 17, 2014
    Date of Patent: December 26, 2017
    Assignee: Teradata US, Inc.
    Inventors: Eric M. Shank, Steven B. Cohen, Donald Pederson, Philip J. Benton, Gary Lee Boggs, Albert O. Lam, Wayne R. Boyle
  • Patent number: 9720623
    Abstract: Techniques for management of data in multi-storage systems allow managing storage of data in one of the multiple storages (e.g., a HDD) based on the information associated with the storage and/or access of data (e.g., logical hits of data in a cache memory) in another one of the storages (e.g., a cache memory) of the multi-storage system. In one aspect, information associated with storage and/or access of data in a volatile (or non-persistent) storage environment is provided for managing the storage of data in a non-volatile (or persistent) storage environment. By way of example, data access information associated with a volatile storage environment (e.g., logical hits of data in a cache) can be effectively communicated to a non-volatile storage environment, for example, as information that can be indicative of data temperatures. Moreover, the information obtained from a non-volatile storage environment can be persistently stored for and/or in the non-volatile environment (e.g.
    Type: Grant
    Filed: December 17, 2014
    Date of Patent: August 1, 2017
    Assignee: Teradata US, Inc.
    Inventors: Philip J. Benton, Steven B. Cohen, Eric M. Shank, Albert O. Lam, Gary Lee Boggs, Donald Pederson, Wayne R. Boyle
  • Patent number: 9703505
    Abstract: Techniques for management of data in multi-storage systems allow managing storage of data in a first storage of multiple storages in a multi-storage system based on the temperature of the data (or data temperature) obtained for a second storage of the multiple storages in a multi-storage system. For example, in a multi-storage system that includes at least one non-volatile storage (e.g., one or more HDDs) and at least one volatile storage (e.g., a cache memory device), the storage of a particular data portion (e.g., a storage unit of data) for the at least one volatile storage can be managed based on a temperature of the data determined for the non-volatile storage. By way of example, persistent temperatures used for management of data in a non-volatile storage system (e.g., a multi-tier storage of a database system) can be used to effectively manage the storage of the data in a cache memory that is typically provided for improving performance by keeping data that is likely to be used in the cache memory.
    Type: Grant
    Filed: December 17, 2014
    Date of Patent: July 11, 2017
    Assignee: Teradata US, Inc.
    Inventors: Wayne R. Boyle, Philip J. Benton, Donald Pederson
  • Publication number: 20150186045
    Abstract: Techniques for management of data in multi-storage systems allow managing storage of data in a first storage of multiple storages in a multi-storage system based on the temperature of the data (or data temperature) obtained for a second storage of the multiple storages in a multi-storage system. For example, in a multi-storage system that includes at least one non-volatile storage (e.g., one or more HDDs) and at least one volatile storage (e.g., a cache memory device), the storage of a particular data portion (e.g., a storage unit of data) for the at least one volatile storage can be managed based on a temperature of the data determined for the non-volatile storage. By way of example, persistent temperatures used for management of data in a non-volatile storage system (e.g., a multi-tier storage of a database system) can be used to effectively manage the storage of the data in a cache memory that is typically provided for improving performance by keeping data that is likely to be used in the cache memory.
    Type: Application
    Filed: December 17, 2014
    Publication date: July 2, 2015
    Applicant: Teradata Corporation
    Inventors: Wayne R. Boyle, Philip J. Benton, Donald Pederson
  • Publication number: 20150186047
    Abstract: A combination of non-persistent-based and persistent-based schemes are used to effectively manage volatile storages which are conventionally managed solely by using non-persistent schemes (e.g., LRU schemes in cache memory). Generally, the persistent-based schemes can be based on persistent information associated with a non-volatile storage environment (e.g., persistent data temperatures associated with data stored in non-volatile storages). In this context, a persistent-based scheme can, for example, be effectively used in addition or combination with a conventional scheme provided for volatile memory. By way of example, a LRU scheme can be combined with a scheme based on persistent data temperatures in order to more effectively manage cache memory provided to enhance the performance of a system. As another example, a LRU, a LFU aging schemes can be combined with a scheme based on persistent data temperatures.
    Type: Application
    Filed: December 17, 2014
    Publication date: July 2, 2015
    Applicant: Teradata Corporation
    Inventors: Eric M. Shank, Steven B. Cohen, Donald Pederson, Philip J. Benton, Gary Lee Boggs, Albert O. Lam, Wayne R. Boyle
  • Publication number: 20150186046
    Abstract: Techniques for management of data in multi-storage systems allow managing storage of data in one of the multiple storages (e.g., a HDD) based on the information associated with the storage and/or access of data (e.g., logical hits of data in a cache memory) in another one of the storages (e.g., a cache memory) of the multi-storage system. In one aspect, information associated with storage and/or access of data in a volatile (or non-persistent) storage environment is provided for managing the storage of data in a non-volatile (or persistent) storage environment. By way of example, data access information associated with a volatile storage environment (e.g., logical hits of data in a cache) can be effectively communicated to a non-volatile storage environment, for example, as information that can be indicative of data temperatures. Moreover, the information obtained from a non-volatile storage environment can be persistently stored for and/or in the non-volatile environment (e.g.
    Type: Application
    Filed: December 17, 2014
    Publication date: July 2, 2015
    Applicant: Teradata Corporation
    Inventors: Philip J. Benton, Steven B. Cohen, Eric M. Shank, Albert O. Lam, Gary Lee Boggs, Donald Pederson, Wayne R. Boyle
  • Patent number: 8621482
    Abstract: A method, computer program, and database system are disclosed. A plurality of instances of a request to a database system are received. All instances of the request have a same set of variables to use in executing the request. The values of the variables are supplied by data in a data source. A specific plan for executing one instance of the request is generated. Generating the specific plan includes taking into account data in the data source. The specific plan is executed on the database system. A system run-time metric and a parsing time for executing the specific plan are captured and saved. A generic plan is generated and cached based on a comparison of the system run-time metric and the parsing time for executing the specific plan.
    Type: Grant
    Filed: September 5, 2008
    Date of Patent: December 31, 2013
    Assignee: Teradata US, Inc.
    Inventors: Bhashyam Ramesh, Donald Pederson, Manjula Koppuravuri
  • Publication number: 20130173586
    Abstract: A system, method, and computer readable medium are provided for reducing response time variation in a workload management system for a database system. When a query response is generated in response to a database query from a client, a determination may be made as to whether response time of the query response is less than a predetermined amount of time. Delivery of the query response to the client is delayed when an amount of time associated with the query response is less than the predetermined amount of time.
    Type: Application
    Filed: March 8, 2012
    Publication date: July 4, 2013
    Inventors: John Mark Morris, Douglas P. Brown, Donald Pederson
  • Patent number: 8452730
    Abstract: A method of archiving a set of source tables in a database system. Each source table has a plurality of rows. Initially, a consistency point for the set of source tables is established. The database system creates a log record for each change (insert, modify, or delete) effected to a row of the source tables subsequent to the consistency point. Substantially all source table rows are copied to an archive (a data storage object that is external to the database system). Then the accumulated log records for the affected source tables are distilled and appended to the archive.
    Type: Grant
    Filed: December 8, 2008
    Date of Patent: May 28, 2013
    Assignee: Teradata US, Inc.
    Inventors: May Pederson, James Chapman, Cuong Nhan, Jeremy Davis, Donald Pederson, James Pierce, Sunanda Reddy, Stephen Sheldon
  • Patent number: 8346714
    Abstract: A temporal table is present in an active data warehouse (“ADW”) on a massively parallel processing system (“MPP system”). The MPP system includes a plurality of units of parallelism. Each of the plurality of units of parallelism maintains its own moving system time separate from that of the other units of parallelism. A load-job for the ADW is accepted. The load-job includes a requested modification to an identified row. The identified row is stored in the temporal table on a first of the MPP system's units of parallelism. The requested modification is implemented on the identified row. The identified row is timestamped with the moving system time maintained by the first of the MPP system's units of parallelism at the time of the implementation of the modification.
    Type: Grant
    Filed: December 17, 2009
    Date of Patent: January 1, 2013
    Assignee: Teradota US, Inc.
    Inventors: Bhashyam Ramesh, Donald Pederson
  • Publication number: 20120078860
    Abstract: A method, apparatus, and article of manufacture for accessing data in a computer system. One or more user-defined functions (UDFs) implementing a desired compression or decompression algorithm are created, wherein the UDFs are associated with one or more columns of a table when the table is created or altered, in order to perform compression or decompression of data stored in the associated columns, such that the data is compressed by the UDF implementing the desired compression algorithm when the data is inserted or updated in the table, and the data is decompressed by the UDF implementing the desired decompression algorithm when the data is retrieved from the table.
    Type: Application
    Filed: November 11, 2010
    Publication date: March 29, 2012
    Applicant: TERADATA US, INC.
    Inventors: Gary Roberts, Venkata Ramakrishna Tirunagari, Harish Ramachandran, Frederick Kaufmann, Aikyatha Kamalakar, Mark Hodgens, Donald Pederson
  • Patent number: 7849111
    Abstract: Various embodiments may include taking an initial dump of a database table and tracking changes to the database table, with regard to but outside of transactions, since a most recent full or partial dump has been taken. A partial dump, in such embodiments, may be taken since the most recent full or partial dump and used to create a data structure which may be used to update only those database table rows modified since a last full or partial dump. As a result, the dumps of a database table will include a single full dump and may include one or more partial dumps. These full and partial dumps may then be instantiated to create or update an instance of the database table. In some embodiments, dumps may be taken directly to a mirrored instance of a database table.
    Type: Grant
    Filed: December 31, 2007
    Date of Patent: December 7, 2010
    Assignee: Teradata US, Inc.
    Inventors: Bill Huffman, Donald Pederson, May Pederson, Richard Pogue
  • Publication number: 20090172051
    Abstract: Various embodiments may include taking an initial dump of a database table and tracking changes to the database table, with regard to but outside of transactions, since a most recent full or partial dump has been taken. A partial dump, in such embodiments, may be taken since the most recent full or partial dump and used to create a data structure which may be used to update only those database table rows modified since a last full or partial dump. As a result, the dumps of a database table will include a single full dump and may include one or more partial dumps. These full and partial dumps may then be instantiated to create or update an instance of the database table. In some embodiments, dumps may be taken directly to a mirrored instance of a database table.
    Type: Application
    Filed: December 31, 2007
    Publication date: July 2, 2009
    Inventors: Bill Huffman, Donald Pederson, May Pederson, Richard Pogue
  • Publication number: 20090157775
    Abstract: A method of archiving a set of source tables in a database system. Each source table has a plurality of rows. Initially, a consistency point for the set of source tables is established. The database system creates a log record for each change (insert, modify, or delete) effected to a row of the source tables subsequent to the consistency point. Substantially all source table rows are copied to an archive (a data storage object that is external to the database system). Then the accumulated log records for the affected source tables are distilled and appended to the archive.
    Type: Application
    Filed: December 8, 2008
    Publication date: June 18, 2009
    Inventors: May Pederson, James Chapman, Cuong Nhan, Jeremy Davis, Donald Pederson, James Pierce, Sunanda Reddy, Stephen Sheldon
  • Publication number: 20080034054
    Abstract: A technique for use in managing message passing between processors within a database system involves providing a plurality of message buffers on each of those processors that are configured to send or receive messages, the number of buffers on each processor being less than the number of processors. A reservation list is also provided on each of those processors that are configured to send or receive messages.
    Type: Application
    Filed: August 7, 2006
    Publication date: February 7, 2008
    Inventors: Curtis Stehley, Donald Pederson
  • Patent number: 7213025
    Abstract: Implementations of a partitioned database system and a method of using a database system are disclosed. One system implementation includes storage facilities. Each storage facility includes data from database table rows. The database table rows in each storage facility that correspond to a specific database table are logically ordered according to a row identifier (row ID). The row ID includes a first value that is based on one or more columns of the table. The row ID also includes a second value that is based on one or more columns of the table, which may be different from or the same as those on which the first value is based. The first value of the row ID is predominate in determining the order of the rows in the storage facilities. The second value determines the order of those rows with identical first values.
    Type: Grant
    Filed: October 16, 2001
    Date of Patent: May 1, 2007
    Assignee: NCR Corporation
    Inventors: Paul L. Sinclair, Donald Pederson, Steven Bart Cohen
  • Publication number: 20060012662
    Abstract: A method, system, and computer readable medium for digital proofing comprises producing a digital proof on at least one substrate, wherein the substrate has been surface-treated with at least one coating, wherein an overall appearance of the substrate is unaltered by the coating, and wherein the substrate is adapted to be printed on a printing device.
    Type: Application
    Filed: July 14, 2004
    Publication date: January 19, 2006
    Inventors: Pierre Ferland, Donald Pederson
  • Publication number: 20030074348
    Abstract: Implementations of a partitioned database system and a method of using a database system are disclosed. One system implementation includes storage facilities. Each storage facility includes data from database table rows. The database table rows in each storage facility that correspond to a specific database table are logically ordered according to a row identifier (row ID). The row ID includes a first value that is based on one or more columns of the table. The row ID also includes a second value that is based on one or more columns of the table, which may be different from or the same as those on which the first value is based. The first value of the row ID is predominate in determining the order of the rows in the storage facilities. The second value determines the order of those rows with identical first values.
    Type: Application
    Filed: October 16, 2001
    Publication date: April 17, 2003
    Applicant: NCR Corporation
    Inventors: Paul L. Sinclair, Donald Pederson, Steven Bart Cohen