Patents by Inventor Mir Hamid Pirahesh

Mir 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: 11216455
    Abstract: 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: Grant
    Filed: August 24, 2019
    Date of Patent: January 4, 2022
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Sui Jun Tong, Yuanyuan Tian, Wen Sun, Mir Hamid Pirahesh
  • Patent number: 11119678
    Abstract: 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: Grant
    Filed: June 27, 2019
    Date of Patent: September 14, 2021
    Assignee: International Business Machines Corporation
    Inventors: 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: 11106671
    Abstract: 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: Grant
    Filed: September 14, 2018
    Date of Patent: August 31, 2021
    Assignee: International Business Machines Corporation
    Inventors: Mir Hamid Pirahesh, Yuanyuan Tian
  • Patent number: 11100102
    Abstract: 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: Grant
    Filed: September 24, 2018
    Date of Patent: August 24, 2021
    Assignee: International Business Machines Corporation
    Inventors: Mir Hamid Pirahesh, Yuanyuan Tian
  • Publication number: 20210056104
    Abstract: 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: Application
    Filed: August 24, 2019
    Publication date: February 25, 2021
    Inventors: Sui Jun Tong, Yuanyuan Tian, Wen Sun, Mir Hamid Pirahesh
  • Patent number: 10691646
    Abstract: 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: Grant
    Filed: March 5, 2018
    Date of Patent: June 23, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Mohamed Eltabakh, Peter J. Haas, Fatma Ozcan, Mir Hamid Pirahesh, John (Yannis) Sismanis, Jan Vondrak
  • Publication number: 20200151196
    Abstract: 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: Application
    Filed: January 20, 2020
    Publication date: May 14, 2020
    Inventors: Ronald J. Barber, Ronen Grosman, Mir Hamid Pirahesh, Vijayshankar Raman, Adam J. Storm
  • Patent number: 10606863
    Abstract: 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: Grant
    Filed: March 15, 2017
    Date of Patent: March 31, 2020
    Assignee: International Business Machines Corporation
    Inventors: Ronald J. Barber, Ronen Grosman, Mir Hamid Pirahesh, Vijayshankar Raman, Adam J. Storm
  • Publication number: 20190317666
    Abstract: 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: Application
    Filed: June 27, 2019
    Publication date: October 17, 2019
    Inventors: 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: 10430100
    Abstract: 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: Grant
    Filed: February 28, 2018
    Date of Patent: October 1, 2019
    Assignee: International Business Machines Corporation
    Inventors: 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: 20190265891
    Abstract: 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: Application
    Filed: February 28, 2018
    Publication date: August 29, 2019
    Inventors: 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: 20190026333
    Abstract: 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: Application
    Filed: September 24, 2018
    Publication date: January 24, 2019
    Applicant: International Business Machines Corporation
    Inventors: Mir Hamid Pirahesh, Yuanyuan Tian
  • Publication number: 20190012346
    Abstract: 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: Application
    Filed: September 14, 2018
    Publication date: January 10, 2019
    Applicant: International Business Machines Corporation
    Inventors: Mir Hamid Pirahesh, Yuanyuan Tian
  • Patent number: 10176220
    Abstract: 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: Grant
    Filed: December 14, 2015
    Date of Patent: January 8, 2019
    Assignee: International Business Machines Corporation
    Inventors: Mir Hamid Pirahesh, Yuanyuan Tian
  • Publication number: 20180268044
    Abstract: 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: Application
    Filed: March 15, 2017
    Publication date: September 20, 2018
    Inventors: Ronald J. Barber, Ronen Grosman, Mir Hamid Pirahesh, Vijayshankar Raman, Adam J. Storm
  • Publication number: 20180196828
    Abstract: 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: Application
    Filed: March 5, 2018
    Publication date: July 12, 2018
    Inventors: Mohamed Eltabakh, Peter J. Haas, Fatma Ozcan, Mir Hamid Pirahesh, John (Yannis) Sismanis, Jan Vondrak
  • Patent number: 9910860
    Abstract: 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: Grant
    Filed: February 6, 2014
    Date of Patent: March 6, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Mohamed Eltabakh, Peter J. Haas, Fatma Ozcan, Mir Hamid Pirahesh, John (Yannis) Sismanis, Jan Vondrak
  • Publication number: 20170169073
    Abstract: 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: Application
    Filed: December 14, 2015
    Publication date: June 15, 2017
    Applicant: International Business Machines Corporation
    Inventors: Mir Hamid Pirahesh, Yuanyuan Tian
  • Patent number: 9141667
    Abstract: Embodiments of the invention relate to processing queries that utilize fact and/or dimension tables. In one aspect, a pre-join filtering phase precedes a star join. The necessary conditions for the pre-join filtering are considered for a given SQL query, including an estimated size of the hash table exceeding a threshold and presence of a local predicate either on the fact table or one or more dimension tables that is not a large dimension table. Once the necessary conditions are satisfied, the execution of the query exploits the pre-join filtering to build a pre-join output filter from columns of a reduced fact table that joins with each large dimension table. Thereafter, all the dimension tables and the fact table are joined in a star join while exploiting each pre-join filter.
    Type: Grant
    Filed: January 31, 2013
    Date of Patent: September 22, 2015
    Assignee: International Business Machines Corporation
    Inventors: Ronald J. Barber, Naresh K. Chainani, Guy M. Lohman, Mir Hamid Pirahesh, Vijayshankar Raman, Richard S. Sidle, Sandeep Tata
  • Publication number: 20150220529
    Abstract: 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: Application
    Filed: February 6, 2014
    Publication date: August 6, 2015
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Mohamed Eltabakh, Peter J. Haas, Fatma Ozcan, Mir Hamid Pirahesh, John (Yannis) Sismanis, Jan Vondrak