Patents by Inventor Antoni Wolski
Antoni Wolski 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: 11392388Abstract: Provided is a process for determining a number of parallel threads for a request. The process involves receiving availability data regarding processing resources, wherein the availability data indicates which processing resources are idle or are to become idle. Based on the availability data, a number of parallel threads for the request is determined.Type: GrantFiled: November 27, 2019Date of Patent: July 19, 2022Assignee: Huawei Technologies Co., Ltd.Inventors: Mahesh Kumar Behera, Prasanna Venkatesh Ramamurthi, Antoni Wolski
-
Patent number: 11366799Abstract: A device for executing an operation on a database is provided. The device comprises a C-queue configured to store a plurality of column-oriented operations, an R-queue configured to store a plurality of row-oriented operations, a scheduler configured to assign the operation to the C-queue or the R-queue based on whether the operation is row-oriented, a timing unit configured to alternate between C-type time slots and R-type time slots, an execution unit configured to execute operations from the C-queue in C-type time slots and/or operations from the R-queue in R-type time slots.Type: GrantFiled: October 21, 2019Date of Patent: June 21, 2022Assignee: Huawei Technologies Co., Ltd.Inventors: Kalyan Sivakumar, Antoni Wolski, Mahesh Kumar Behera
-
Patent number: 10621202Abstract: A method for copying values of a table of a database between a primary memory and a secondary memory comprises selecting one or more segments, wherein the table is organized in a plurality of stripes and a plurality of vertical partitions, wherein a stripe comprises at least two rows of the table, wherein a vertical partition comprises one or more columns of the table, wherein each of the plurality of segments comprises values at a cross-section of a stripe and a vertical partition, and wherein each of the plurality of segments stores adjacent column values in adjacent locations of the primary or the secondary memory, and copying the one or more selected segments between the primary memory and the secondary memory.Type: GrantFiled: July 21, 2017Date of Patent: April 14, 2020Assignee: HUAWEI TECHNOLOGIES CO., LTD.Inventors: Eliezer Levy, Zhibiao Chen, Usama Dar, Aharon Avitzur, Shay Goikhman, Antoni Wolski
-
Publication number: 20200097297Abstract: Provided is a process for determining a number of parallel threads for a request. The process involves receiving availability data regarding processing resources, wherein the availability data indicates which processing resources are idle or are to become idle. Based on the availability data, a number of parallel threads for the request is determined.Type: ApplicationFiled: November 27, 2019Publication date: March 26, 2020Inventors: Mahesh Kumar BEHERA, Prasanna Venkatesh RAMAMURTHI, Antoni WOLSKI
-
Publication number: 20200050597Abstract: Device for executing an operation on a database, the device comprising a C-queue configured to store a plurality of column-oriented operations, an R-queue configured to store a plurality of row-oriented operations, a scheduler configured to assign the operation to the C-queue or the R-queue based on whether the operation is row-oriented, a timing unit configured to alternate between C-type time slots and R-type time slots, an execution unit configured to execute operations from the C-queue in C-type time slots and/or operations from the R-queue in R-type time slots.Type: ApplicationFiled: October 21, 2019Publication date: February 13, 2020Inventors: Kalyan SIVAKUMAR, Antoni WOLSKI, Mahesh Kumar BEHERA
-
Patent number: 10503601Abstract: A method for tracking objects in a first memory during a plurality of time intervals is provided, wherein the method comprises: updating, by one or more update threads, copying, by the one or more test threads, the one or more non-copied shadow objects to a second memory, determining, by the one or more test threads whether the step of copying the one or more non-copied shadow objects was successful, and updating, by the one or more test threads, the status variables of corresponding objects that correspond to the one or more non-copied shadow objects that were copied successfully, wherein subsequent bits of the status variables correspond to subsequent time intervals and wherein the one or more update threads and the one or more test threads operate on disjoint sets of bits of the status variables.Type: GrantFiled: October 2, 2017Date of Patent: December 10, 2019Assignee: HUAWEI TECHNOLOGIES CO., LTD.Inventors: Shay Goikhman, Antoni Wolski, Eliezer Levy, Antonios Iliopoulos
-
Patent number: 10114908Abstract: Embodiments relate to a method, system, and computer program product for data management. An aspect includes a search index that is created for a database. The search index has a reference value of a first or a second type associating data to a storage location in a first memory or a second memory respectively. Responsive to a data retrieval request, data is accessed using the reference value from the first or the second memory. If there is a data migration between the first and second memory storage, the reference values are then recalculated and altered in the search index accordingly.Type: GrantFiled: November 13, 2012Date of Patent: October 30, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jarmo Parkkinen, Vilho T. Raatikka, Jarmo K. Ruuth, Petri U. Soini, Antoni Wolski
-
Publication number: 20180046548Abstract: A method for tracking objects in a first memory during a plurality of time intervals is provided, wherein the method comprises: updating, by one or more update threads, copying, by the one or more test threads, the one or more non-copied shadow objects to a second memory, determining, by the one or more test threads whether the step of copying the one or more non-copied shadow objects was successful, and updating, by the one or more test threads, the status variables of corresponding objects that correspond to the one or more non-copied shadow objects that were copied successfully, wherein subsequent bits of the status variables correspond to subsequent time intervals and wherein the one or more update threads and the one or more test threads operate on disjoint sets of bits of the status variables.Type: ApplicationFiled: October 2, 2017Publication date: February 15, 2018Inventors: Shay Goikhman, Antoni Wolski, Eliezer Levy, Antonios Iliopoulos
-
Publication number: 20170322997Abstract: A method for copying values of a table of a database between a primary memory and a secondary memory comprises selecting one or more segments, wherein the table is organized in a plurality of stripes and a plurality of vertical partitions, wherein a stripe comprises at least two rows of the table, wherein a vertical partition comprises one or more columns of the table, wherein each of the plurality of segments comprises values at a cross-section of a stripe and a vertical partition, and wherein each of the plurality of segments stores adjacent column values in adjacent locations of the primary or the secondary memory, and copying the one or more selected segments between the primary memory and the secondary memory.Type: ApplicationFiled: July 21, 2017Publication date: November 9, 2017Inventors: Eliezer Levy, Zhibiao Chen, Usama Dar, Aharon Avitzur, Shay Goikhman, Antoni Wolski
-
Publication number: 20170083286Abstract: The invention relates to a sorting method (1100), the sorting method comprising: sorting (1101) the distributed input data locally per processing node (701, 702) by deploying first processes on the processing nodes (701, 702) to produce a plurality of sorted lists on the local memory partitions (401, 402, 403, 404) of the processing nodes (701, 702); creating (1102) a sequence of range blocks (703, 704, 713, 714) on the local memory partitions of the processing nodes (701, 702), copying (1103) the plurality of sorted lists to the sequence of range blocks (703, 704, 713, 714); and reading (1105) the sorted elements from the sequence of range blocks (703, 704, 713, 714) sequentially with respect to their range to obtain the sorted input data.Type: ApplicationFiled: November 30, 2016Publication date: March 23, 2017Inventors: Mahesh Kumar BEHERA, Prasanna Venkatesh RAMAMURTHI, Antoni WOLSKI
-
Patent number: 9495398Abstract: Providing an index for a database table that includes a first portion of rows stored in a memory device and a second portion of rows stored in a disk device. A request is received relating to a specific row of the database table. An index that includes entries for each row of the database table stored in the memory device and entries for a subset of the rows of the database table stored in the disk device is accessed. A connection is made to the memory device if the specific row is stored in the memory device, and a connection is made to the disk device if the specific row is stored in the disk device. An action related to the specific row is performed based on the received request.Type: GrantFiled: January 30, 2012Date of Patent: November 15, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jarmo Parkkinen, Vilho T. Raatikka, Jarmo K. Ruuth, Petri U. Soini, Antoni Wolski
-
Publication number: 20140136510Abstract: Embodiments relate to a method, system, and computer program product for data management. An aspect includes a search index that is created for a database. The search index has a reference value of a first or a second type associating data to a storage location in a first memory or a second memory respectively. Responsive to a data retrieval request, data is accessed using the reference value from the first or the second memory. If there is a data migration between the first and second memory storage, the reference values are then recalculated and altered in the search index accordingly.Type: ApplicationFiled: November 13, 2012Publication date: May 15, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jarmo Parkkinen, Vilho T. Raatikka, Jarmo K. Ruuth, Petri U. Soini, Antoni Wolski
-
Publication number: 20120215752Abstract: Providing an index for a database table that includes a first portion of rows stored in a memory device and a second portion of rows stored in a disk device. A request is received relating to a specific row of the database table. An index that includes entries for each row of the database table stored in the memory device and entries for a subset of the rows of the database table stored in the disk device is accessed. A connection is made to the memory device if the specific row is stored in the memory device, and a connection is made to the disk device if the specific row is stored in the disk device. An action related to the specific row is performed based on the received request.Type: ApplicationFiled: January 30, 2012Publication date: August 23, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Jarmo Parkkinen, Vilho T. Raatikka, Jarmo K. Ruuth, Petri U. Soini, Antoni Wolski
-
Patent number: 7502796Abstract: A method and arrangement for optimizing performance and data safety in a system includes first and second database servers coupled to a communication network. The first database server accepts transactions from a client application, stores them according to a data storage method, and sends them to the second database server via the communication network, whereupon the second database server also store the transactions. The first database server receives information about the server availability state of the second database server and detects changes in the availability state of the second database server in a such manner, that the data storage method of the first database server is changed according to the change in the availability state of the second database server.Type: GrantFiled: June 16, 2004Date of Patent: March 10, 2009Assignee: Solid Information Technology OyInventors: Jarmo Parkkinen, Antoni Wolski
-
Publication number: 20050283522Abstract: A method and arrangement for optimizing performance and data safety in a system includes first and second database servers coupled to a communication network. The first database server accepts transactions from a client application, stores them according to a data storage method, and sends them to the second database server via the communication network, whereupon the second database server also store the transactions. The first database server receives information about the server availability state of the second database server and detects changes in the availability state of the second database server in a such manner, that the data storage method of the first database server is changed according to the change in the availability state of the second database server.Type: ApplicationFiled: June 16, 2004Publication date: December 22, 2005Inventors: Jarmo Parkkinen, Antoni Wolski
-
Patent number: 6978396Abstract: This invention relates generally to database servers and computer systems and, more particularly, describes the mechanism to run transaction operations originating from a primary server used to replicate data in parallel in a secondary server. Especially the invention relates to running concurrent or parallel operations in a secondary server for redundancy, recovery and propagated transactions. This invention describes how parallel operation in a secondary server improves performance and availability and how it maintains transaction order and output congruent with the primary server where transaction operations are originated.Type: GrantFiled: May 30, 2002Date of Patent: December 20, 2005Assignee: Solid Information Technology OyInventors: Jarmo Ruuth, Jarmo Parkkinen, Petri Soini, Antoni Wolski
-
Publication number: 20030225760Abstract: This invention relates generally to database servers and computer systems and, more particularly, describes the mechanism to run transaction operations originating from a primary server used to replicate data in parallel in a secondary server. Especially the invention relates to running concurrent or parallel operations in a secondary server for redundancy, recovery and propagated transactions. This invention describes how parallel operation in a secondary server improves performance and availability and how it maintains transaction order and output congruent with the primary server where transaction operations are originated.Type: ApplicationFiled: May 30, 2002Publication date: December 4, 2003Inventors: Jarmo Ruuth, Jarmo Parkkinen, Petri Soini, Antoni Wolski