Patents by Inventor Hamid Pirahesh
Hamid Pirahesh 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: 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: 11216455Abstract: A method and system of processing graph query are provided. A graph query is received by a relational database graph module. The graph query is translated into one or more relational database queries. One or more relational database queries are translated to be performed on data stored within a relational database. One or more results from the relational database are received based on the sent one or more relational database queries. A synergistic graph is generated on a display, based on the received one or more results.Type: GrantFiled: August 24, 2019Date of Patent: January 4, 2022Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Sui Jun Tong, Yuanyuan Tian, Wen Sun, Mir Hamid Pirahesh
-
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
-
Patent number: 11106671Abstract: Embodiments of the invention relate to executing graph path queries. A database stores data entities and attributes in node tables and stores links between nodes in an edge table. Edges form a path between a source node and a target node. A source node set is generated and joined with the edge table to produce a first intermediate set. Similarly, a target node set is generated and joined with the edge table to produce a second intermediate set. A result path is generated through a joining of the first and second intermediate paths and application of a length condition.Type: GrantFiled: September 14, 2018Date of Patent: August 31, 2021Assignee: International Business Machines CorporationInventors: Mir Hamid Pirahesh, Yuanyuan Tian
-
Patent number: 11100102Abstract: Embodiments relate to executing graph path queries. A database stores data entities and attributes in node tables and stores links between nodes in an edge table. Edges form a path between a source node and a target node. A source node set is generated and joined with the edge table to produce a first intermediate set. Similarly, a target node set is generated and joined with the edge table to produce a second intermediate set. A result path is generated through a joining of the first and second intermediate paths and application of a length condition.Type: GrantFiled: September 24, 2018Date of Patent: August 24, 2021Assignee: International Business Machines CorporationInventors: Mir Hamid Pirahesh, Yuanyuan Tian
-
Publication number: 20210056104Abstract: A method and system of processing graph query are provided. A graph query is received by a relational database graph module. The graph query is translated into one or more relational database queries. One or more relational database queries are translated to be performed on data stored within a relational database. One or more results from the relational database are received based on the sent one or more relational database queries. A synergistic graph is generated on a display, based on the received one or more results.Type: ApplicationFiled: August 24, 2019Publication date: February 25, 2021Inventors: Sui Jun Tong, Yuanyuan Tian, Wen Sun, Mir Hamid Pirahesh
-
Patent number: 10691646Abstract: Embodiments of the present invention relate to elimination of blocks such as splits in distributed processing systems such as MapReduce systems using the Hadoop Distributed Filing System (HDFS). In one embodiment, a method of and computer program product for optimizing queries in distributed processing systems are provided. A query is received. The query includes at least one predicate. The query refers to data. The data includes a plurality of records. Each record comprises a plurality of values in a plurality of attributes. Each record is located in at least one of a plurality of blocks of a distributed file system. Each block has a unique identifier. For each block of the distributed file system, at least one value cluster is determined for an attribute of the plurality of attributes. Each value cluster has a range. The predicate of the query is compared with the at least one value cluster of each block.Type: GrantFiled: March 5, 2018Date of Patent: June 23, 2020Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mohamed Eltabakh, Peter J. Haas, Fatma Ozcan, Mir Hamid Pirahesh, John (Yannis) Sismanis, Jan Vondrak
-
Publication number: 20200151196Abstract: 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: ApplicationFiled: January 20, 2020Publication date: May 14, 2020Inventors: Ronald J. Barber, Ronen Grosman, Mir Hamid Pirahesh, Vijayshankar Raman, Adam J. Storm
-
Patent number: 10606863Abstract: One embodiment provides for monotonic transactions in a multi-master database with loosely coupled nodes including performing, by a processor, a write transaction protocol including: a client device issuing write transactions at any of the nodes, recording a write transaction locally at a node that issues a write transaction and asynchronously replicating the write transaction to at least one other node, and waiting for reception of an acknowledgment from at least a quorum of the nodes before returning a response to the client device. The quorum is any set of the nodes that includes a special node and at least one other node.Type: GrantFiled: March 15, 2017Date of Patent: March 31, 2020Assignee: International Business Machines CorporationInventors: Ronald J. Barber, Ronen Grosman, Mir Hamid Pirahesh, Vijayshankar Raman, Adam J. Storm
-
Publication number: 20190317666Abstract: 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: ApplicationFiled: June 27, 2019Publication date: October 17, 2019Inventors: Ronald J. Barber, Christian Garcia-Arellano, Ronen Grosman, Matthew A. Huras, Mir Hamid Pirahesh, Vijayshankar Raman, Richard S. Sidle, Adam J. Storm, Pinar Tozun
-
Patent number: 10430100Abstract: 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. Each column in the table is loaded with column values based on the identifications. Records based on the column values are written to the groomed transaction blocks that are table based, and the tuple sequence numbers for each record on groomed blocks are generated. The table is shared/sharded across nodes handling transactional operations in the multi-master distributed data management system to increase processing handling of the transactional operations.Type: GrantFiled: February 28, 2018Date of Patent: October 1, 2019Assignee: 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: 20190265891Abstract: 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. Each column in the table is loaded with column values based on the identifications. Records based on the column values are written to the groomed transaction blocks that are table based, and the tuple sequence numbers for each record on groomed blocks are generated. The table is shared/sharded across nodes handling transactional operations in the multi-master distributed data management system to increase processing handling of the transactional operations.Type: ApplicationFiled: February 28, 2018Publication date: August 29, 2019Inventors: 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: 20190026333Abstract: Embodiments relate to executing graph path queries. A database stores data entities and attributes in node tables and stores links between nodes in an edge table. Edges form a path between a source node and a target node. A source node set is generated and joined with the edge table to produce a first intermediate set. Similarly, a target node set is generated and joined with the edge table to produce a second intermediate set. A result path is generated through a joining of the first and second intermediate paths and application of a length condition.Type: ApplicationFiled: September 24, 2018Publication date: January 24, 2019Applicant: International Business Machines CorporationInventors: Mir Hamid Pirahesh, Yuanyuan Tian
-
Publication number: 20190012346Abstract: Embodiments of the invention relate to executing graph path queries. A database stores data entities and attributes in node tables and stores links between nodes in an edge table. Edges form a path between a source node and a target node. A source node set is generated and joined with the edge table to produce a first intermediate set. Similarly, a target node set is generated and joined with the edge table to produce a second intermediate set. A result path is generated through a joining of the first and second intermediate paths and application of a length condition.Type: ApplicationFiled: September 14, 2018Publication date: January 10, 2019Applicant: International Business Machines CorporationInventors: Mir Hamid Pirahesh, Yuanyuan Tian
-
Patent number: 10176220Abstract: Embodiments of the invention relate to executing graph path queries. A database stores data entities and attributes in node tables and stores links between nodes in an edge table. Edges form a path between a source node and a target node. A source node set is generated and joined with the edge table to produce a first intermediate set. Similarly, a target node set is generated and joined with the edge table to produce a second intermediate set. A result path is generated through a joining of the first and second intermediate paths and application of a length condition.Type: GrantFiled: December 14, 2015Date of Patent: January 8, 2019Assignee: International Business Machines CorporationInventors: Mir Hamid Pirahesh, Yuanyuan Tian
-
Publication number: 20180268044Abstract: One embodiment provides for monotonic transactions in a multi-master database with loosely coupled nodes including performing, by a processor, a write transaction protocol including: a client device issuing write transactions at any of the nodes, recording a write transaction locally at a node that issues a write transaction and asynchronously replicating the write transaction to at least one other node, and waiting for reception of an acknowledgment from at least a quorum of the nodes before returning a response to the client device. The quorum is any set of the nodes that includes a special node and at least one other node.Type: ApplicationFiled: March 15, 2017Publication date: September 20, 2018Inventors: Ronald J. Barber, Ronen Grosman, Mir Hamid Pirahesh, Vijayshankar Raman, Adam J. Storm
-
Publication number: 20180196828Abstract: Embodiments of the present invention relate to elimination of blocks such as splits in distributed processing systems such as MapReduce systems using the Hadoop Distributed Filing System (HDFS). In one embodiment, a method of and computer program product for optimizing queries in distributed processing systems are provided. A query is received. The query includes at least one predicate. The query refers to data. The data includes a plurality of records. Each record comprises a plurality of values in a plurality of attributes. Each record is located in at least one of a plurality of blocks of a distributed file system. Each block has a unique identifier. For each block of the distributed file system, at least one value cluster is determined for an attribute of the plurality of attributes. Each value cluster has a range. The predicate of the query is compared with the at least one value cluster of each block.Type: ApplicationFiled: March 5, 2018Publication date: July 12, 2018Inventors: Mohamed Eltabakh, Peter J. Haas, Fatma Ozcan, Mir Hamid Pirahesh, John (Yannis) Sismanis, Jan Vondrak
-
Patent number: 9910860Abstract: Embodiments of the present invention relate to elimination of blocks such as splits in distributed processing systems such as MapReduce systems using the Hadoop Distributed Filing System (HDFS). In one embodiment, a method of and computer program product for optimizing queries in distributed processing systems are provided. A query is received. The query includes at least one predicate. The query refers to data. The data includes a plurality of records. Each record comprises a plurality of values in a plurality of attributes. Each record is located in at least one of a plurality of blocks of a distributed file system. Each block has a unique identifier. For each block of the distributed file system, at least one value cluster is determined for an attribute of the plurality of attributes. Each value cluster has a range. The predicate of the query is compared with the at least one value cluster of each block.Type: GrantFiled: February 6, 2014Date of Patent: March 6, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mohamed Eltabakh, Peter J. Haas, Fatma Ozcan, Mir Hamid Pirahesh, John (Yannis) Sismanis, Jan Vondrak
-
Patent number: 9767149Abstract: Embodiments relate to joining data across a parallel database and a distributed processing system. Aspects include receiving a query on data stored in parallel database T and data stored in distributed processing system L, applying local query predicates and projection to data T to create T?, and applying local query predicates and projection to L to create L?. Based on determining that a size of L? is less than a size of T? and that the size of L? is less than a first threshold, transmitting L? to the parallel database and executing a join between T? and L?. Based on determining that a number of the nodes distributed processing system n multiplied by the size of T? is less than the size of L? and that the size of T? is less than a second threshold; transmitting T? to the distributed processing system and executing a join between T? and L?.Type: GrantFiled: October 10, 2014Date of Patent: September 19, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Fatma Ozcan, Hamid Pirahesh, Yuanyuan Tian, Tao Zou
-
Publication number: 20170169073Abstract: Embodiments of the invention relate to executing graph path queries. A database stores data entities and attributes in node tables and stores links between nodes in an edge table. Edges form a path between a source node and a target node. A source node set is generated and joined with the edge table to produce a first intermediate set. Similarly, a target node set is generated and joined with the edge table to produce a second intermediate set. A result path is generated through a joining of the first and second intermediate paths and application of a length condition.Type: ApplicationFiled: December 14, 2015Publication date: June 15, 2017Applicant: International Business Machines CorporationInventors: Mir Hamid Pirahesh, Yuanyuan Tian