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: 11853322Abstract: One embodiment provides for a method to track replication state and providing quorum visible retrievals. The method includes assigning, by a writer node performing write operations, a sequence number. The sequence number is replicated with a write operation to other replica nodes in an asynchronous fashion thru a first network channel. On a second network channel, a state of a local system is communicated by sending a latest sequence number available that has been hardened to the other replica nodes. A query is obtained by a reader node, and a sequence number limit is selected. Results up to the sequence number limit are returned.Type: GrantFiled: August 7, 2018Date of Patent: December 26, 2023Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Ronald J. Barber, Vijayshankar Raman, Ronen Grosman, Christian M. Garcia-Arellano, Chandrasekaran Mohan
-
Patent number: 11487727Abstract: One embodiment provides for a method including performing, by a processing thread, a process that analyzes transactional operations by maintaining the transactional operations in transaction local side logs, and waiting until a successful transaction commit to append the transaction local side logs to a log stream. The processing thread processes the transactional operations on a key used to determine whether existing data is found for the key. The transactional operations are sped up through parallelism based on partitioning tables across nodes handling the transactional operations. A first process is performed by a first processor that processes updates for values of a key based on updating a first start time table index using unique keys and a start time field of a row for a first appearance of each unique key from the transactional operations.Type: GrantFiled: April 15, 2021Date of Patent: November 1, 2022Assignee: International Business Machines CorporationInventors: Yuanyuan Tian, Vijayshankar Raman, Ronald J. Barber, Richard S. Sidle, Pinar Tozun, Rene Mueller, Ronen Grosman, Adam J. Storm, Christian M. Garcia-Arellano, Guy M. Lohman
-
Patent number: 11216436Abstract: 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: GrantFiled: June 18, 2019Date of Patent: January 4, 2022Assignee: International Business Machines CorporationInventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Calisto P. Zuzarte
-
Publication number: 20210232554Abstract: One embodiment provides for a method including performing, by a processing thread, a process that analyzes transactional operations by maintaining the transactional operations in transaction local side logs, and waiting until a successful transaction commit to append the transaction local side logs to a log stream. The processing thread processes the transactional operations on a key used to determine whether existing data is found for the key. The transactional operations are sped up through parallelism based on partitioning tables across nodes handling the transactional operations. A first process is performed by a first processor that processes updates for values of a key based on updating a first start time table index using unique keys and a start time field of a row for a first appearance of each unique key from the transactional operations.Type: ApplicationFiled: April 15, 2021Publication date: July 29, 2021Inventors: Yuanyuan Tian, Vijayshankar Raman, Ronald J. Barber, Richard S. Sidle, Pinar Tozun, Rene Mueller, Ronen Grosman, Adam J. Storm, Christian M. Garcia-Arellano, Guy M. Lohman
-
Patent number: 11042522Abstract: One embodiment provides for a method including processing transactional operations on a key used to determine whether existing data is found for that key. A first time index is updated using unique keys and a start time field of a first appearance of each key from the transactional operations. A deferred update of prior versions of the key is performed for non-recent data upon determining that recent data in the transactional operations is found for the key.Type: GrantFiled: June 11, 2018Date of Patent: June 22, 2021Assignee: International Business Machines CorporationInventors: Yuanyuan Tian, Vijayshankar Raman, Ronald J. Barber, Richard S. Sidle, Pinar Tozun, Rene Mueller, Ronen Grosman, Adam J. Storm, Christian M. Garcia-Arellano, Guy M. Lohman
-
Patent number: 10942784Abstract: 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: GrantFiled: January 22, 2020Date of Patent: March 9, 2021Assignee: International Business Machines CorporationInventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Gennady Yakub
-
Patent number: 10725995Abstract: 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: GrantFiled: March 30, 2017Date of Patent: July 28, 2020Assignee: International Business Machines CorporationInventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Calisto P. Zuzarte
-
Patent number: 10725994Abstract: 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: GrantFiled: April 8, 2016Date of Patent: July 28, 2020Assignee: International Business Machines CorporationInventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Calisto P. Zuzarte
-
Patent number: 10691687Abstract: 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: GrantFiled: December 18, 2017Date of Patent: June 23, 2020Assignee: International Business Machines CorporationInventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Calisto P. Zuzarte
-
Publication number: 20200159585Abstract: 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: ApplicationFiled: January 22, 2020Publication date: May 21, 2020Inventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Gennady Yakub
-
Patent number: 10657122Abstract: 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: GrantFiled: April 27, 2018Date of Patent: May 19, 2020Assignee: International Business Machines CorporationInventors: Christian M. Garcia-Arellano, Hamdi Roumani, Adam J. Storm
-
Patent number: 10649991Abstract: 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: GrantFiled: April 26, 2016Date of Patent: May 12, 2020Assignee: International Business Machines CorporationInventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Calisto P. Zuzarte
-
Patent number: 10620837Abstract: 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: GrantFiled: April 27, 2017Date of Patent: April 14, 2020Assignee: International Business Machines CorporationInventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Gennady Yakub
-
Patent number: 10585707Abstract: 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: GrantFiled: June 27, 2017Date of Patent: March 10, 2020Assignee: International Business Machines CorporationInventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Gennady Yakub
-
Publication number: 20200050697Abstract: One embodiment provides for a method to track replication state and providing quorum visible retrievals. The method includes assigning, by a writer node performing write operations, a sequence number. The sequence number is replicated with a write operation to other replica nodes in an asynchronous fashion thru a first network channel. On a second network channel, a state of a local system is communicated by sending a latest sequence number available that has been hardened to the other replica nodes. A query is obtained by a reader node, and a sequence number limit is selected. Results up to the sequence number limit are returned.Type: ApplicationFiled: August 7, 2018Publication date: February 13, 2020Inventors: Ronald J. Barber, Vijayshankar Raman, Ronen Grosman, Christian M. Garcia-Arellano, Chandrasekaran Mohan
-
Publication number: 20190377809Abstract: One embodiment provides for a method including processing transactional operations on a key used to determine whether existing data is found for that key. A first time index is updated using unique keys and a start time field of a first appearance of each key from the transactional operations. A deferred update of prior versions of the key is performed for non-recent data upon determining that recent data in the transactional operations is found for the key.Type: ApplicationFiled: June 11, 2018Publication date: December 12, 2019Inventors: Yuanyuan Tian, Vijayshankar Raman, Ronald J. Barber, Richard S. Sidle, Pinar Tozun, Rene Mueller, Ronen Grosman, Adam J. Storm, Christian M. Garcia-Arellano, Guy M. Lohman
-
Publication number: 20190303358Abstract: 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: ApplicationFiled: June 18, 2019Publication date: October 3, 2019Inventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Calisto P. Zuzarte
-
Patent number: 10372698Abstract: 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: GrantFiled: June 12, 2015Date of Patent: August 6, 2019Assignee: International Business Machines CorporationInventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Calisto P. Zuzarte
-
Patent number: 10366068Abstract: 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: GrantFiled: December 18, 2014Date of Patent: July 30, 2019Assignee: International Business Machines CorporationInventors: Ian R. Finlay, Christian M. Garcia-Arellano, Adam J. Storm, Calisto P. Zuzarte
-
Patent number: 10275482Abstract: 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: GrantFiled: June 9, 2017Date of Patent: April 30, 2019Assignee: International Business Machines CorporationInventors: Christian M. Garcia-Arellano, Hamdi Roumani, Adam J. Storm