Patents by Inventor John Smirnios
John Smirnios 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: 11681618Abstract: A computer implemented system and method of memory management for an in-memory database. The system implements a paged data vector using non-uniform compression of its chunks. In this manner, the system achieves greater compression than systems that use uniform compression.Type: GrantFiled: June 30, 2021Date of Patent: June 20, 2023Assignee: SAP SEInventors: Gary Lin, Reza Sherkat, John Smirnios
-
Publication number: 20230103328Abstract: Techniques and solutions are described for compressing data and facilitating access to compressed data. Compression can be applied to proper data subsets of a data set, such as to columns of a table. Using various methods, the proper data subsets can be evaluated to be included in a group of proper data subsets to be compressed using a first compression technique, where unselected proper data subsets are not compressed using the first compression technique. Data in the data set can be reordered based on a reordering sequence for the proper data subsets. Reordering data in the data set can improve compression when at least a portion of the proper data subsets are compressed. A data structure is provided that facilitates accessing specified data stored in a compressed format.Type: ApplicationFiled: December 1, 2022Publication date: April 6, 2023Applicant: SAP SEInventors: Jia Shi, Reza Sherkat, John Smirnios
-
Patent number: 11593352Abstract: Systems and methods include determination of a first logical page number of a first database page to be persisted, identification of a first blockmap page associated with the first logical page number, determination, from the first blockmap page, of a block number associated with the first logical page number, determination that the block number is an object key, determination, in response to the determination, that the block number is an object key, determination of a first object key to associate with the first logical page number, and writing of the first database page to the object store using the first object key.Type: GrantFiled: March 10, 2021Date of Patent: February 28, 2023Assignee: SAP SEInventors: Mohammed Abouzour, Gunes Aluc, Ivan Bowman, Xi Deng, Nandan Marathe, Sagar Ranadive, Muhammed Sharique, John Smirnios
-
Patent number: 11558067Abstract: Techniques and solutions are described for compressing data and facilitating access to compressed data. Compression can be applied to proper data subsets of a data set, such as to columns of a table. Using various methods, the proper data subsets can be evaluated to be included in a group of proper data subsets to be compressed using a first compression technique, where unselected proper data subsets are not compressed using the first compression technique. Data in the data set can be reordered based on a reordering sequence for the proper data subsets. Reordering data in the data set can improve compression when at least a portion of the proper data subsets are compressed. A data structure is provided that facilitates accessing specified data stored in a compressed format.Type: GrantFiled: May 19, 2020Date of Patent: January 17, 2023Assignee: SAP SEInventors: Jia Shi, Reza Sherkat, John Smirnios
-
Publication number: 20220164335Abstract: Systems and methods include determination of a first logical page number of a first database page to be persisted, identification of a first blockmap page associated with the first logical page number, determination, from the first blockmap page, of a block number associated with the first logical page number, determination that the block number is an object key, determination, in response to the determination, that the block number is an object key, determination of a first object key to associate with the first logical page number, and writing of the first database page to the object store using the first object key.Type: ApplicationFiled: March 10, 2021Publication date: May 26, 2022Inventors: Mohammed ABOUZOUR, Gunes ALUC, Ivan BOWMAN, Xi DENG, Nandan MARATHE, Sagar RANADIVE, Muhammed SHARIQUE, John SMIRNIOS
-
Patent number: 11226965Abstract: Disclosed herein are system, method, and computer program product embodiments for partition pruning via non-homogenous synopsis information. An embodiment operates by maintaining synopsis information for a data partition in accordance with a first synopsis strategy, monitoring performance of the synopsis information within a partition pruning system, determining that the performance of the synopsis information is insufficient, and updating the synopsis information in accordance with a second synopsis strategy better suited for the attributes of the data partition. In some embodiments, a first data partition of a partitioned data table may employ a first synopsis strategy and a second data partition of the partitioned data table may employ a second synopsis strategy.Type: GrantFiled: April 27, 2018Date of Patent: January 18, 2022Assignee: SAP SEInventors: William Zou, Reza Sherkat, John Smirnios, Mihnea Andrei
-
Patent number: 11216346Abstract: Disclosed herein are system, method, and computer program product embodiments for coordinated replication of heterogeneous database stores. An embodiment operates by determining a synchronization point based on a commit log of a primary data center. A current log position of each of a plurality of secondary slave servers associated with a secondary master server of a secondary data center is requested. It is determined that the current log position of at least one of the secondary slave servers does not correspond to the logged position of a corresponding primary slave server relative to the synchronization point. An update indicating that the current log position of each of the secondary slave servers corresponds to the logged position of each of the relative corresponding primary slave servers is received. A replay of each of the secondary slave servers up to the synchronization point is initiated.Type: GrantFiled: January 22, 2018Date of Patent: January 4, 2022Assignee: SAP SEInventors: Mahendra Chavan, Reiner Singer, Markus Behrens, John Smirnios, Anant Agarwal
-
Publication number: 20210367613Abstract: Techniques and solutions are described for compressing data and facilitating access to compressed data. Compression can be applied to proper data subsets of a data set, such as to columns of a table. Using various methods, the proper data subsets can be evaluated to be included in a group of proper data subsets to be compressed using a first compression technique, where unselected proper data subsets are not compressed using the first compression technique. Data in the data set can be reordered based on a reordering sequence for the proper data subsets. Reordering data in the data set can improve compression when at least a portion of the proper data subsets are compressed. A data structure is provided that facilitates accessing specified data stored in a compressed format.Type: ApplicationFiled: May 19, 2020Publication date: November 25, 2021Applicant: SAP SEInventors: Jia Shi, Reza Sherkat, John Smirnios
-
Patent number: 11163773Abstract: Disclosed herein are system, method, and computer program product embodiments for partition pruning using globally encoded range partition information. An embodiment operates by partitioning a data table into a plurality of data partitions, determining a plurality of sub-partitions within the data partitions, and determining a global range table based at least in part on value ranges corresponding to the sub-partitions. Further, the global range table may be used to determine bit vectors for the data partitions and query predicates. In some examples, the bit vectors may be used to determine whether to prune data partitions during execution of a query over a large data volume.Type: GrantFiled: April 27, 2018Date of Patent: November 2, 2021Assignee: SAP SEInventors: Yu-Jui Chen, Reza Sherkat, John Smirnios, Mihnea Andrei
-
Publication number: 20210326259Abstract: A computer implemented system and method of memory management for an in-memory database. The system implements a paged data vector using non-uniform compression of its chunks. In this manner, the system achieves greater compression than systems that use uniform compression.Type: ApplicationFiled: June 30, 2021Publication date: October 21, 2021Inventors: Gary Lin, Reza Sherkat, John Smirnios
-
Patent number: 11080187Abstract: A computer implemented system and method of memory management for an in-memory database. The system implements a paged data vector using non-uniform compression of its chunks. In this manner, the system achieves greater compression than systems that use uniform compression.Type: GrantFiled: June 12, 2020Date of Patent: August 3, 2021Assignee: SAP SEInventors: Gary Lin, Reza Sherkat, John Smirnios
-
Publication number: 20200301835Abstract: A computer implemented system and method of memory management for an in-memory database. The system implements a paged data vector using non-uniform compression of its chunks. In this manner, the system achieves greater compression than systems that use uniform compression.Type: ApplicationFiled: June 12, 2020Publication date: September 24, 2020Inventors: Gary Lin, Reza Sherkat, John Smirnios
-
Patent number: 10725911Abstract: A computer implemented system and method of memory management for an in-memory database. The system implements a paged data vector using non-uniform compression of its chunks. In this manner, the system achieves greater compression than systems that use uniform compression.Type: GrantFiled: December 10, 2018Date of Patent: July 28, 2020Assignee: SAP SEInventors: Gary Lin, Reza Sherkat, John Smirnios
-
Publication number: 20200183839Abstract: A computer implemented system and method of memory management for an in-memory database. The system implements a paged data vector using non-uniform compression of its chunks. In this manner, the system achieves greater compression than systems that use uniform compression.Type: ApplicationFiled: December 10, 2018Publication date: June 11, 2020Inventors: Gary Lin, Reza Sherkat, John Smirnios
-
Publication number: 20190236192Abstract: Disclosed herein are system, method, and computer program product embodiments for partition pruning via non-homogenous synopsis information. An embodiment operates by maintaining synopsis information for a data partition in accordance with a first synopsis strategy, monitoring performance of the synopsis information within a partition pruning system, determining that the performance of the synopsis information is insufficient, and updating the synopsis information in accordance with a second synopsis strategy better suited for the attributes of the data partition. In some embodiments, a first data partition of a partitioned data table may employ a first synopsis strategy and a second data partition of the partitioned data table may employ a second synopsis strategy.Type: ApplicationFiled: April 27, 2018Publication date: August 1, 2019Inventors: William Zou, Reza Sherkat, John Smirnios, Mihnea Andrei
-
Publication number: 20190236193Abstract: Disclosed herein are system, method, and computer program product embodiments for partition pruning using globally encoded range partition information. An embodiment operates by partitioning a data table into a plurality of data partitions, determining a plurality of sub-partitions within the data partitions, and determining a global range table based at least in part on value ranges corresponding to the sub-partitions. Further, the global range table may be used to determine bit vectors for the data partitions and query predicates. In some examples, the bit vectors may be used to determine whether to prune data partitions during execution of a query over a large data volume.Type: ApplicationFiled: April 27, 2018Publication date: August 1, 2019Inventors: Yu-Jui CHEN, Reza Sherkat, John Smirnios, Mihnea Andrei
-
Publication number: 20190155705Abstract: Disclosed herein are system, method, and computer program product embodiments for coordinated replication of heterogeneous database stores. An embodiment operates by determining a synchronization point based on a commit log of a primary data center. A current log position of each of a plurality of secondary slave servers associated with a secondary master server of a secondary data center is requested. It is determined that the current log position of at least one of the secondary slave servers does not correspond to the logged position of a corresponding primary slave server relative to the synchronization point. An update indicating that the current log position of each of the secondary slave servers corresponds to the logged position of each of the relative corresponding primary slave servers is received. A replay of each of the secondary slave servers up to the synchronization point is initiated.Type: ApplicationFiled: January 22, 2018Publication date: May 23, 2019Inventors: Mahendra Chavan, Reiner Singer, Markus Behrens, John Smirnios, Anant Agarwal
-
Patent number: 10169093Abstract: In an example embodiment, a method of operating a task scheduler for one or more processors is provided. A topology of one or more processors is obtained, the topology indicating a plurality of execution units and physical resources associated with each of the plurality of execution units. A task to be performed by the one or more processors is received. Then a plurality of available execution units from the plurality of execution units is identified. An optimal execution unit is then determined, from the plurality of execution units, to which to assign the task, based on the topology. The task is then assigned to the optimal execution unit, after which the task is sent to the optimal execution unit for execution.Type: GrantFiled: August 23, 2017Date of Patent: January 1, 2019Assignee: SYBASE, INC.Inventors: Mohammed Abouzour, John Smirnios
-
Publication number: 20170351550Abstract: In an example embodiment, a method of operating a task scheduler for one or more processors is provided. A topology of one or more processors is obtained, the topology indicating a plurality of execution units and physical resources associated with each of the plurality of execution units. A task to be performed by the one or more processors is received. Then a plurality of available execution units from the plurality of execution units is identified. An optimal execution unit is then determined, from the plurality of execution units, to which to assign the task, based on the topology. The task is then assigned to the optimal execution unit, after which the task is sent to the optimal execution unit for execution.Type: ApplicationFiled: August 23, 2017Publication date: December 7, 2017Inventors: Mohammed Abouzour, John Smirnios
-
Patent number: 9753780Abstract: In an example embodiment, a method of operating a task scheduler for one or more processors is provided. A topology of one or more processors is obtained, the topology indicating a plurality of execution units and physical resources associated with each of the plurality of execution units. A task to be performed by the one or more processors is received. Then a plurality of available execution units from the plurality of execution units is identified. An optimal execution unit is then determined, from the plurality of execution units, to which to assign the task, based on the topology. The task is then assigned to the optimal execution unit, after which the task is sent to the optimal execution unit for execution.Type: GrantFiled: July 7, 2015Date of Patent: September 5, 2017Assignee: SYBASE, INC.Inventors: Mohammed Abouzour, John Smirnios