Patents by Inventor Ronen Grosman
Ronen Grosman 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: 11995069Abstract: A system and method for an online transaction system to transition from operating under a first mode (FM) to operating under a second mode (SM), and vice versa. In the FM, transaction nodes identify transactions with sequential numbers obtained from a global transaction server (GTS). In the SM, transaction nodes identify consecutive transactions with timestamps based on global clock servers (GCSs). When transitioning from one mode to the other mode, a controller instructs the transactions nodes to provide GCS-based transaction timestamps and error bounds to the GTS, which modifies the timestamps and the error bounds based on previously received timestamps and error bounds, and on the latest transaction number issued by the GTS. Modified timestamps and error bounds are obtained at the transaction nodes. Each transaction is timestamped with its respective modified timestamp. But there is a delay equal to the modified error bound before requesting another modified timestamp.Type: GrantFiled: June 28, 2022Date of Patent: May 28, 2024Assignee: HUAWEI TECHNOLOGIES CO., LTD.Inventors: Huaxin Zhang, Ronen Grosman, Rongzhen Cui
-
Publication number: 20240078252Abstract: The present disclosure provides methods, systems and apparatus for efficient data management in distributed database system. According to an aspect, a method is provided. The method includes relocating a first table and a second table of a database to a first node of the database, wherein the first table and a second table (or one or more tables which have a colocation relationship with the first table) are associated with one or more distribution keys corresponding to one or more columns of the first table and the second table. The method further includes defining a colocation relationship between the first table and the second table based on a distribution key of the one or more distribution keys. The colocation relationship may indicate that data of the first table and the second table that correspond according to the distribution key are to reside on a same node of the database.Type: ApplicationFiled: September 2, 2022Publication date: March 7, 2024Applicant: HUAWEI TECHNOLOGIES CO., LTD.Inventors: Hoi Ieng LAO, Ronen GROSMAN, Yuk Kuen CHAN, Chung Yin Alan WONG, Dmitri ABRASHKEVICH
-
Publication number: 20240037118Abstract: Methods, systems, and computer-readable media are described in which WAL records are replayed serially at the database sub-object level, thereby enabling parallelism for processes affecting a single database object without interfering with the consistency required to maintain ROS capability. WAL records are replayed serially at the B-Tree branch level, instead of existing approaches which serialize WAL record replay at the object or block level. Described examples may thereby enable multi-block operations (e.g., SPLIT) within the same B-Tree branch to be replayed in the correct sequence, thereby maintaining consistent reads during ROS. Multi-level dispatching at the object and sub-object levels may be used to minimize delays caused by operations affecting multiple branches of a database object.Type: ApplicationFiled: July 29, 2022Publication date: February 1, 2024Inventors: Ronen GROSMAN, Sherman LAU, Tian Chen GU, Kristian Robert LEJAO
-
Publication number: 20240028580Abstract: The present disclosure provides for methods and systems related to a unified framework for global table with guarantee on replica data freshness. According to a first aspect, a method is provided. The method includes receiving a first transaction for updating a first table and a second transaction for updating a second table. The first and the second table being respectively associated with a first and second policy. The method further includes generating a first queue indicating the first transaction and a second queue indicating the second transaction. The method further includes receiving from a set of replica nodes information indicating a status of each replica with respect to the first transaction and the second transaction.Type: ApplicationFiled: July 22, 2022Publication date: January 25, 2024Applicant: HUAWEI TECHNOLOGIES CO., LTD.Inventors: Huaxin ZHANG, Ronen GROSMAN, MohammadAli NIKNAMIAN
-
Publication number: 20230418810Abstract: A system and method for an online transaction system to transition from operating under a first mode (FM) to operating under a second mode (SM), and vice versa. In the FM, transaction nodes identify transactions with sequential numbers obtained from a global transaction server (GTS). In the SM, transaction nodes identify consecutive transactions with timestamps based on global clock servers (GCSs). When transitioning from one mode to the other mode, a controller instructs the transactions nodes to provide GCS-based transaction timestamps and error bounds to the GTS, which modifies the timestamps and the error bounds based on previously received timestamps and error bounds, and on the latest transaction number issued by the GTS. Modified timestamps and error bounds are obtained at the transaction nodes. Each transaction is timestamped with its respective modified timestamp. But there is a delay equal to the modified error bound before requesting another modified timestamp.Type: ApplicationFiled: June 28, 2022Publication date: December 28, 2023Applicant: HUAWEI TECHNOLOGIES CO., LTD.Inventors: Huaxin ZHANG, Ronen GROSMAN, Rongzhen CUI
-
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
-
Publication number: 20230185795Abstract: A method and system of processing database transactions in a distributed online transaction processing (OLTP) database is provided. Overhead and network bandwidth associated with a global transaction manager are reduced and scalability improved by determining whether incoming statements are single-shard or multi-shard. For single-shard statements, a local transaction identifier (TXID) stored and associated with a data record reference by the statement is retrieved. The retrieved TXID is compared against a copy of a list of prepared transactions that are pending in a respective data node. If the TXID is in the copy of the prepared list, the statement is caused to await until the previous transaction has been committed or aborted. The visibility of a change committed by the previous is then determined, and the statement is processed.Type: ApplicationFiled: December 14, 2021Publication date: June 15, 2023Inventors: Yuk Kuen CHAN, Ronen GROSMAN, Seyyed Mohammad Hadi SAJJADPOUR, Hoi leng LAO, Wen Hao ZHANG, Chung Yin Alan WONG
-
Patent number: 11669518Abstract: A method and system of processing database transactions in a distributed online transaction processing (OLTP) database is provided. Overhead and network bandwidth associated with a global transaction manager are reduced and scalability improved by determining whether incoming statements are single-shard or multi-shard. For single-shard statements, a local transaction identifier (TXID) stored and associated with a data record reference by the statement is retrieved. The retrieved TXID is compared against a copy of a list of prepared transactions that are pending in a respective data node. If the TXID is in the copy of the prepared list, the statement is caused to await until the previous transaction has been committed or aborted. The visibility of a change committed by the previous is then determined, and the statement is processed.Type: GrantFiled: December 14, 2021Date of Patent: June 6, 2023Assignee: Huawei Technologies Co., Ltd.Inventors: Yuk Kuen Chan, Ronen Grosman, Seyyed Mohammad Hadi Sajjadpour, Hoi leng Lao, Wen Hao Zhang, Chung Yin Alan Wong
-
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
-
Publication number: 20220269667Abstract: Methods and system for a database management system (DBMS) in which a leader thread is elected from concurrent transaction threads stored in one or more data nodes. While the leader thread copies its own thread transaction log onto a reserved portion of the shared log buffer, the leader thread permits other transaction threads to attach to a thread chain starting with the leader thread. Once the leader has completed copying its thread transaction log onto the shared log buffer, it then reserves a portion of the shared log buffer, and copies the member thread transaction logs onto the shared log buffer to reduce the contention for shared buffer may be reduced.Type: ApplicationFiled: February 7, 2022Publication date: August 25, 2022Inventors: Ronen GROSMAN, Ping CHEN
-
Publication number: 20220171756Abstract: A method and system for implementing concurrency control in a database system includes receiving a request from a node for handling by a GTM. Registering the request in a slot in a tracking array where each of the slots represents one of the requests for handling by the GTM. A slot is acquired, and a segment of the tracking array is scanned to determine a batch of pending requests. The batch is used to produce an aggregate request and the aggregate request includes an aggregate increment of a total number of commit requests of the batch. The aggregate request is sent to the GTM using one of a plurality of pre-established connections. A response is received from the GTM that includes a current value of an incremented timestamp. The incremented timestamp is distributed to the requests of the batch and the lock is released.Type: ApplicationFiled: November 26, 2021Publication date: June 2, 2022Applicant: HUAWEI TECHNOLOGIES CO., LTD.Inventors: Ronen GROSMAN, Emad BOCTOR, Ping CHEN, Chaoyi KUANG, Yuk Kuen CHAN, Hoi Ieng LAO
-
Patent number: 11243980Abstract: One embodiment provides for monotonic transactions in a multi-master database with loosely coupled nodes including performing, by a processor, a read transaction protocol including: performing, by the processor, a read transaction protocol including issuing read transactions at any one of the nodes; attempting to return rows that are known to be replicated by at least a read quorum of the nodes; and for timing-out of the attempting to return rows known to be replicated by at least the read quorum of the nodes based on the special-node being non-responsive: selecting a new special-node from the nodes; and repeating attempting to return rows that are known to be replicated by at least the read quorum of the nodes.Type: GrantFiled: January 20, 2020Date of Patent: February 8, 2022Assignee: International Business Machines CorporationInventors: Ronald J. Barber, Ronen Grosman, Mir Hamid Pirahesh, Vijayshankar Raman, Adam J. Storm
-
Patent number: 11182356Abstract: According to one or more embodiments of the present invention, a computer-implemented method includes creating a hybrid index for a multi-zone data storage system in which a first zone has data that is organized for transaction processing, and a second zone that has data organized for analytic processing. Each index entry in the hybrid index includes an index key including an equality column, a begin-timestamp column, and a tuple-sequence-number column. The method further includes building an index run to be included in the hybrid index, the index run includes multiple index entries. An index run is created by selecting columns by scanning data blocks from the first zone, computing tuple-sequence-number values for the index entries to be included in the hybrid index, and sorting the index entries according to a predetermined order using the columns to be included in the index run.Type: GrantFiled: May 23, 2019Date of Patent: November 23, 2021Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Ronald J. Barber, Vijayshankar Raman, Richard Sidle, Yuanyuan Tian, Pinar Tozun, Chen Luo, Adam J. Storm, Ronen Grosman, Matthew J. Spilchen
-
Patent number: 11157499Abstract: Reducing data access resources by creating a scoring mechanism for computing a running score for data objects in a database having an associated score value in order to determine whether or not a set of data object(s) should remain in a caching gateway or whether or not the set of data object(s) should be removed from the caching gateway.Type: GrantFiled: January 3, 2020Date of Patent: October 26, 2021Assignee: International Business Machines CorporationInventors: Gustavo Arocena, Adam J. Storm, Christian Garcia-Arellano, Ronen Grosman, Daniele Costante Zilio
-
Patent number: 11150847Abstract: A request for changing data of a file system data structure stored on a shingled magnetic recording (SMR) drive is received. The data change is logged in a log entry of a log structure stored in a non-volatile random access memory (NVRAM). The log entry is added as a new entry at an end of the log structure. The log entry is marked within the NVRAM as modified and a predetermined criterion is determined to be satisfied. Responsive to determining that the predetermined criterion is satisfied, the NVRAM is searched for log entries marked as modified. The modified log entries are stored to the SMR drive.Type: GrantFiled: July 18, 2019Date of Patent: October 19, 2021Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Carlos D. Cavanna, Ann Corrao, Robert Francis, Ronen Grosman, Hamdi Roumani, Ao Wan
-
Patent number: 11144527Abstract: Optimizing database table scans in presence of SMDO records is provided. An SMDO record corresponding to a most recent span of rows for a column associated with a query predicate is read. It is determined whether a condition for excluding a span of rows is true for the SMDO record based on a type of the query predicate. In response to determining that a condition for excluding a span of rows is not true for the SMDO record, the most recent span of rows is added to a list of spans of rows to scan. It is determined whether a condition for excluding all preceding spans of rows is true for the SMDO record based on the type of the query predicate. In response to determining that a condition for excluding all preceding spans of rows is true for the SMDO record, reading the set of SMDO records is stopped.Type: GrantFiled: January 14, 2020Date of Patent: October 12, 2021Assignee: International Business Machines CorporationInventors: Sunil Sarin, Ronen Grosman, Adam J. Storm
-
Patent number: 11119678Abstract: One embodiment provides for a method for grooming transactional operations in a multi-master distributed data management system including maintaining transactional operations in at least one transaction-local side-log. A table log scan is performed for a table including recording identification for each record in a log. Tuple sequence numbers are generated for the records and the records are written on groomed transaction blocks to the table.Type: GrantFiled: June 27, 2019Date of Patent: September 14, 2021Assignee: International Business Machines CorporationInventors: Ronald J. Barber, Christian Garcia-Arellano, Ronen Grosman, Matthew A. Huras, Mir Hamid Pirahesh, Vijayshankar Raman, Richard S. Sidle, Adam J. Storm, Pinar Tozun
-
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
-
Publication number: 20210216519Abstract: Optimizing database table scans in presence of SMDO records is provided. An SMDO record corresponding to a most recent span of rows for a column associated with a query predicate is read. It is determined whether a condition for excluding a span of rows is true for the SMDO record based on a type of the query predicate. In response to determining that a condition for excluding a span of rows is not true for the SMDO record, the most recent span of rows is added to a list of spans of rows to scan. It is determined whether a condition for excluding all preceding spans of rows is true for the SMDO record based on the type of the query predicate. In response to determining that a condition for excluding all preceding spans of rows is true for the SMDO record, reading the set of SMDO records is stopped.Type: ApplicationFiled: January 14, 2020Publication date: July 15, 2021Inventors: Sunil Sarin, Ronen Grosman, Adam J. Storm
-
Publication number: 20210209107Abstract: Reducing data access resources by creating a scoring mechanism for computing a running score for data objects in a database having an associated score value in order to determine whether or not a set of data object(s) should remain in a caching gateway or whether or not the set of data object(s) should be removed from the caching gateway.Type: ApplicationFiled: January 3, 2020Publication date: July 8, 2021Inventors: Gustavo Arocena, Adam J. Storm, Christian Garcia-Arellano, Ronen Grosman, Daniele Costante Zilio