Patents by Inventor Christian M. Garcia-Arellano

Christian M. Garcia-Arellano 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: 10228855
    Abstract: A method for optimizing query compilation by tuning memory across a database cluster is provided. The method may include receiving, by a global memory tuner, memory configuration information from a plurality of nodes within the database cluster. The method may also include determining a node within the plurality of nodes having a least available memory value relative to a remainder of nodes within the plurality of nodes based on the received memory configuration information. The method may then include calculating a globally tuned memory value based on a memory value associated with the determined node. The method may further include determining a memory distribution based on the calculated globally tuned memory value. The method may also include sending the determined memory distribution to the plurality of nodes.
    Type: Grant
    Filed: March 30, 2016
    Date of Patent: March 12, 2019
    Assignee: International Business Machines Corporation
    Inventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Gennady Yakub
  • Publication number: 20180373567
    Abstract: A method, computer system, and a computer program product for resource scaling is provided. The present invention may include receiving a request for resources. The present invention may include receiving a request for a plurality of resources from a virtual device. The present invention may then include estimating a resource allocation based on a predetermined level of service based on the received request. The present invention may also include estimating a benefit curve of a workload for a plurality of tiers of resources based on the estimated resource allocation. The present invention may further include estimating a performance cost of the workload for the plurality of tiers of resources based on the estimated benefit curve.
    Type: Application
    Filed: June 27, 2017
    Publication date: December 27, 2018
    Inventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Gennady Yakub
  • Publication number: 20180246927
    Abstract: A current minimum memory requirement for each memory consumer of one or more memory consumers of a primary database system is received. A current memory allocation for a standby database system is received. A set of benefit-to-cost metrics is received. A benefit-to-cost metric is a measure of whether each memory consumer would benefit or would not benefit from additional memory. The set of benefit-to-cost metrics is applied to the standby database system to define an upper bound memory allocation of the standby database system to function in the event of a failover from the primary database system. A scaling factor is determined. In response to receiving an indication of a failover of the primary database system to the standby database system, a ramp up of the standby database system is monitored. The ramp up of the standby database system uses the set of benefit-to-cost metrics and the determined scaling factor.
    Type: Application
    Filed: April 27, 2018
    Publication date: August 30, 2018
    Inventors: Christian M. Garcia-Arellano, Hamdi Roumani, Adam J. Storm
  • Patent number: 10013451
    Abstract: A current minimum memory requirement for each memory consumer of one or more memory consumers of a primary database system is received. A current memory allocation for a standby database system is received. A set of benefit-to-cost metrics is received. A benefit-to-cost metric is a measure of whether each memory consumer would benefit or would not benefit from additional memory. The set of benefit-to-cost metrics is applied to the standby database system to define an upper bound memory allocation of the standby database system to function in the event of a failover from the primary database system. A scaling factor is determined. In response to receiving an indication of a failover of the primary database system to the standby database system, a ramp up of the standby database system is monitored. The ramp up of the standby database system uses the set of benefit-to-cost metrics and the determined scaling factor.
    Type: Grant
    Filed: March 16, 2016
    Date of Patent: July 3, 2018
    Assignee: International Business Machines Corporation
    Inventors: Christian M. Garcia-Arellano, Hamdi Roumani, Adam J. Storm
  • Publication number: 20180107710
    Abstract: Embodiments of the present invention provide systems and methods for data management. Synopsis tables have been found to be more effective for maintaining a high level of system performance while answering analytical queries. Synopsis tables, which contain MAX, MIN, and Bloom filter columns, may be modified by dropping ineffective data content within these columns and regenerating dropped data when beneficial. By automatically modifying data, database queries may be optimized.
    Type: Application
    Filed: December 18, 2017
    Publication date: April 19, 2018
    Inventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Calisto P. Zuzarte
  • Publication number: 20170308572
    Abstract: Embodiments of the present invention provide systems and methods for data management. Synopsis tables have been found to be more effective for maintaining a high level of system performance while answering analytical queries. Synopsis tables, which contain MAX, MIN, and Bloom filter columns, may be modified by dropping ineffective data content within these columns and regenerating dropped data when beneficial. By automatically modifying data, database queries may be optimized.
    Type: Application
    Filed: April 26, 2016
    Publication date: October 26, 2017
    Inventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Calisto P. Zuzarte
  • Publication number: 20170293642
    Abstract: Merging adjacent rows of a synopsis table so as to increase the effectiveness of the synopsis table regarding data skipping. Adjacent rows for merging are identified based on statistics regarding: (i) queries of the database; (ii) effectiveness of the synopsis table for data skipping; and (iii) usage of predicates in queries of the database. Once merged, the synopsis table is smaller, and more effective with respect to data skipping, while fewer computing resources (administrative, maintenance, memory, clock cycles, storage space, etc.) are needed to process the database queries.
    Type: Application
    Filed: March 30, 2017
    Publication date: October 12, 2017
    Inventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Calisto P. Zuzarte
  • Publication number: 20170293649
    Abstract: Merging adjacent rows of a synopsis table so as to increase the effectiveness of the synopsis table regarding data skipping. Adjacent rows for merging are identified based on statistics regarding: (i) queries of the database; (ii) effectiveness of the synopsis table for data skipping; and (iii) usage of predicates in queries of the database. Once merged, the synopsis table is smaller, and more effective with respect to data skipping, while fewer computing resources (administrative, maintenance, memory, clock cycles, storage space, etc.) are needed to process the database queries.
    Type: Application
    Filed: April 8, 2016
    Publication date: October 12, 2017
    Inventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Calisto P. Zuzarte
  • Publication number: 20170285965
    Abstract: A method for optimizing query compilation by tuning memory across a database cluster is provided. The method may include receiving, by a global memory tuner, memory configuration information from a plurality of nodes within the database cluster. The method may also include determining a node within the plurality of nodes having a least available memory value relative to a remainder of nodes within the plurality of nodes based on the received memory configuration information. The method may then include calculating a globally tuned memory value based on a memory value associated with the determined node. The method may further include determining a memory distribution based on the calculated globally tuned memory value. The method may also include sending the determined memory distribution to the plurality of nodes.
    Type: Application
    Filed: April 27, 2017
    Publication date: October 5, 2017
    Inventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Gennady Yakub
  • Publication number: 20170285964
    Abstract: A method for optimizing query compilation by tuning memory across a database cluster is provided. The method may include receiving, by a global memory tuner, memory configuration information from a plurality of nodes within the database cluster. The method may also include determining a node within the plurality of nodes having a least available memory value relative to a remainder of nodes within the plurality of nodes based on the received memory configuration information. The method may then include calculating a globally tuned memory value based on a memory value associated with the determined node. The method may further include determining a memory distribution based on the calculated globally tuned memory value. The method may also include sending the determined memory distribution to the plurality of nodes.
    Type: Application
    Filed: March 30, 2016
    Publication date: October 5, 2017
    Inventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Gennady Yakub
  • Publication number: 20170277611
    Abstract: A current minimum memory requirement for each memory consumer of one or more memory consumers of a primary database system is received. A current memory allocation for a standby database system is received. A set of benefit-to-cost metrics is received. A benefit-to-cost metric is a measure of whether each memory consumer would benefit or would not benefit from additional memory. The set of benefit-to-cost metrics is applied to the standby database system to define an upper bound memory allocation of the standby database system to function in the event of a failover from the primary database system. A scaling factor is determined. In response to receiving an indication of a failover of the primary database system to the standby database system, a ramp up of the standby database system is monitored. The ramp up of the standby database system uses the set of benefit-to-cost metrics and the determined scaling factor.
    Type: Application
    Filed: June 9, 2017
    Publication date: September 28, 2017
    Inventors: Christian M. Garcia-Arellano, Hamdi Roumani, Adam J. Storm
  • Publication number: 20170270016
    Abstract: A current minimum memory requirement for each memory consumer of one or more memory consumers of a primary database system is received. A current memory allocation for a standby database system is received. A set of benefit-to-cost metrics is received. A benefit-to-cost metric is a measure of whether each memory consumer would benefit or would not benefit from additional memory. The set of benefit-to-cost metrics is applied to the standby database system to define an upper bound memory allocation of the standby database system to function in the event of a failover from the primary database system. A scaling factor is determined. In response to receiving an indication of a failover of the primary database system to the standby database system, a ramp up of the standby database system is monitored. The ramp up of the standby database system uses the set of benefit-to-cost metrics and the determined scaling factor.
    Type: Application
    Filed: March 16, 2016
    Publication date: September 21, 2017
    Inventors: Christian M. Garcia-Arellano, Hamdi Roumani, Adam J. Storm
  • Patent number: 9665512
    Abstract: A computer-implemented method includes assigning a threshold value to a memory consumer and assigning a bias value to the threshold value. The ability to free memory of the consumer by the consumer is monitored. In response to a determination to reclaim the memory, the consumer is directed to reclaim the memory. The threshold value is transformed responsive to whether the reclaiming exhibits at least one of time-out or completion of reclaim after a predetermined time. Per memory consumer control values are updated and the memory is logically partitioned according to a defined ratio into at least a first portion and a second portion. Subsequent to directing the consumer to reclaim the memory, the memory is reclaimed from the second portion and, subsequently, the second portion is replenished from the first portion in a manner that maintains the defined ratio. A corresponding computer system and computer program product are also disclosed.
    Type: Grant
    Filed: November 5, 2015
    Date of Patent: May 30, 2017
    Assignee: International Business Machines Corporation
    Inventors: Christian M. Garcia-Arellano, Adam J. Storm
  • Publication number: 20160188247
    Abstract: A computer-implemented method includes assigning a threshold value to a memory consumer and assigning a bias value to the threshold value. The ability to free memory of the consumer by the consumer is monitored. In response to a determination to reclaim the memory, the consumer is directed to reclaim the memory. The threshold value is transformed responsive to whether the reclaiming exhibits at least one of time-out or completion of reclaim after a predetermined time. Per memory consumer control values are updated and the memory is logically partitioned according to a defined ratio into at least a first portion and a second portion. Subsequent to directing the consumer to reclaim the memory, the memory is reclaimed from the second portion and, subsequently, the second portion is replenished from the first portion in a manner that maintains the defined ratio. A corresponding computer system and computer program product are also disclosed.
    Type: Application
    Filed: November 5, 2015
    Publication date: June 30, 2016
    Inventors: Christian M. Garcia-Arellano, Adam J. Storm
  • Publication number: 20160179858
    Abstract: The method includes identifying at least one of a minimum value, a maximum value, and a Bloom filter value for a row of data in a metadata table, wherein the metadata table contains metadata corresponding to a row of data in a main table. The method includes adjusting at least one of an identified first minimum value to a second minimum value, an identified first maximum value to a second maximum value, and an identified first Bloom filter value to a second Bloom filter value.
    Type: Application
    Filed: December 18, 2014
    Publication date: June 23, 2016
    Inventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Calisto P. Zuzarte
  • Publication number: 20160179896
    Abstract: The method includes identifying at least one of a minimum value, a maximum value, and a Bloom filter value for a row of data in a metadata table, wherein the metadata table contains metadata corresponding to a row of data in a main table. The method includes adjusting at least one of an identified first minimum value to a second minimum value, an identified first maximum value to a second maximum value, and an identified first Bloom filter value to a second Bloom filter value.
    Type: Application
    Filed: June 12, 2015
    Publication date: June 23, 2016
    Inventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Calisto P. Zuzarte