Patents by Inventor NEGAR KOOCHAKZADEH
NEGAR KOOCHAKZADEH 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: 11943316Abstract: Systems and techniques are disclosed for multiplexing database connections with a database proxy, in association with prepared statements. When a client sends initial messages, via a client connection, that set up a prepared statement with a database, the database proxy stores corresponding prepared statement setup data in state data associated with the client connection. When the client sends subsequent messages via the client connection that invoke the prepared statement, the database proxy selects a database connection to use to forward the subsequent messages to the database. The database proxy uses the stored prepared statement setup data to select a database connection that the database already associates with the prepared statement, or to inject prepared statement setup messages that cause the database to set up the prepared statement with the selected database connection.Type: GrantFiled: December 2, 2022Date of Patent: March 26, 2024Inventors: Yoni Shalom, Negar Koochakzadeh, Prateek Sahu
-
Patent number: 11163800Abstract: Techniques for non-power-of-two partitioning of a data set as well as generation and selection of partition schemes for the data set. In an embodiment, one or more iterations of a partition scheme is for a non-power-of-two number of partitions. Extended hash partitioning may be used to partition a data set into a non-power-of-two number of partitions by determining the partition identifier of each tuple of the data set using the extended hash partitioning algorithm. In an embodiment, multiple partition schemes are generated for multiple data sets, based on properties of the data sets and/or availability of computing resources for the partition operation or the subsequent operation to the partition operation. The generated partition schemes may use non-power-of-two partitioning for one or more iterations of a generated partition scheme. The most optimal partition scheme may be selected from the generated partition schemes based on optimization policies.Type: GrantFiled: August 15, 2019Date of Patent: November 2, 2021Assignee: Oracle International CorporationInventors: Negar Koochakzadeh, Nitin Kunal, Sam Idicula, Cagri Balkesen, Nipun Agarwal
-
Patent number: 10802896Abstract: A system includes reception, at a first computing node in a cluster of computing nodes, of a request to subscribe to a first message queue of a messaging middleware software component, determination, at the first computing node, of a preferred number of computing nodes of the cluster of computing nodes to listen to the first message queue, determination, at the first computing node and based on data stored in a shared database accessible to each computing node of the cluster, a current number of computing nodes of the cluster which are listening to the first message queue, and, based on a difference between the preferred number and the current number, sending one or more requests to the messaging middleware software component to associate one or more of the computing nodes of the cluster with the first message queue.Type: GrantFiled: November 1, 2018Date of Patent: October 13, 2020Assignee: SAP SEInventors: Negar Koochakzadeh, Alexei Potiagalov
-
Publication number: 20200142759Abstract: A system includes reception, at a first computing node in a cluster of computing nodes, of a request to subscribe to a first message queue of a messaging middleware software component, determination, at the first computing node, of a preferred number of computing nodes of the cluster of computing nodes to listen to the first message queue, determination, at the first computing node and based on data stored in a shared database accessible to each computing node of the cluster, a current number of computing nodes of the cluster which are listening to the first message queue, and, based on a difference between the preferred number and the current number, sending one or more requests to the messaging middleware software component to associate one or more of the computing nodes of the cluster with the first message queue.Type: ApplicationFiled: November 1, 2018Publication date: May 7, 2020Inventors: Negar Koochakzadeh, Alexei Potiagalov
-
Patent number: 10592531Abstract: Techniques for non-power-of-two partitioning of a data set as well as generation and selection of partition schemes for the data set. In an embodiment, one or more iterations of a partition scheme is for a non-power-of-two number of partitions. Extended hash partitioning may be used to partition a data set into a non-power-of-two number of partitions by determining the partition identifier of each tuple of the data set using the extended hash partitioning algorithm. In an embodiment, multiple partition schemes are generated for multiple data sets, based on properties of the data sets and/or availability of computing resources for the partition operation or the subsequent operation to the partition operation. The generated partition schemes may use non-power-of-two partitioning for one or more iterations of a generated partition scheme. The most optimal partition scheme may be selected from the generated partition schemes based on optimization policies.Type: GrantFiled: February 21, 2017Date of Patent: March 17, 2020Assignee: Oracle International CorporationInventors: Negar Koochakzadeh, Nitin Kunal, Sam Idicula, Cagri Balkesen, Nipun Agarwal
-
Publication number: 20190370268Abstract: Techniques for non-power-of-two partitioning of a data set as well as generation and selection of partition schemes for the data set. In an embodiment, one or more iterations of a partition scheme is for a non-power-of-two number of partitions. Extended hash partitioning may be used to partition a data set into a non-power-of-two number of partitions by determining the partition identifier of each tuple of the data set using the extended hash partitioning algorithm. In an embodiment, multiple partition schemes are generated for multiple data sets, based on properties of the data sets and/or availability of computing resources for the partition operation or the subsequent operation to the partition operation. The generated partition schemes may use non-power-of-two partitioning for one or more iterations of a generated partition scheme. The most optimal partition scheme may be selected from the generated partition schemes based on optimization policies.Type: ApplicationFiled: August 15, 2019Publication date: December 5, 2019Inventors: NEGAR KOOCHAKZADEH, NITIN KUNAL, SAM IDICULA, CAGRI BALKESEN, NIPUN AGARWAL
-
Patent number: 10366124Abstract: Techniques are described herein for grouping of operations in local memory of a processing unit. The techniques involve adding a first operation for a first leaf operator of a query execution plan to a first pipelined group. The query execution plan includes a set of leaf operators and a set of non-leaf operators. Each leaf operator of the set of one or more leaf operators has a respective parent non-leaf operator and each non-leaf operator has one or more child operators from among the set of leaf operators or others of the set of non-leaf operators. The techniques further involve determining a memory requirement of executing the first operation for the first leaf operator and executing a second operation for the respective parent non-leaf operator of the first leaf operator. The output of the first operation is input to the second operation. The techniques further involve determining whether the memory requirement is satisfied by an amount of local memory.Type: GrantFiled: June 7, 2017Date of Patent: July 30, 2019Assignee: Oracle International CorporationInventors: Jian Wen, Sam Idicula, Nitin Kunal, Negar Koochakzadeh, Seema Sundara, Thomas Chang, Aarti Basant, Nipun Agarwal, Farhan Tauheed
-
Publication number: 20180357331Abstract: Techniques are described herein for grouping of operations in local memory of a processing unit. The techniques involve adding a first operation for a first leaf operator of a query execution plan to a first pipelined group. The query execution plan includes a set of leaf operators and a set of non-leaf operators. Each leaf operator of the set of one or more leaf operators has a respective parent non-leaf operator and each non-leaf operator has one or more child operators from among the set of leaf operators or others of the set of non-leaf operators. The techniques further involve determining a memory requirement of executing the first operation for the first leaf operator and executing a second operation for the respective parent non-leaf operator of the first leaf operator. The output of the first operation is input to the second operation. The techniques further involve determining whether the memory requirement is satisfied by an amount of local memory.Type: ApplicationFiled: June 7, 2017Publication date: December 13, 2018Inventors: Jian Wen, Sam Idicula, Nitin Kunal, Negar Koochakzadeh, Seema Sundara, Thomas Chang, Aarti Basant, Nipun Agarwal, Farhan Tauheed
-
Publication number: 20180239808Abstract: Techniques for non-power-of-two partitioning of a data set as well as generation and selection of partition schemes for the data set. In an embodiment, one or more iterations of a partition scheme is for a non-power-of-two number of partitions. Extended hash partitioning may be used to partition a data set into a non-power-of-two number of partitions by determining the partition identifier of each tuple of the data set using the extended hash partitioning algorithm. In an embodiment, multiple partition schemes are generated for multiple data sets, based on properties of the data sets and/or availability of computing resources for the partition operation or the subsequent operation to the partition operation. The generated partition schemes may use non-power-of-two partitioning for one or more iterations of a generated partition scheme. The most optimal partition scheme may be selected from the generated partition schemes based on optimization policies.Type: ApplicationFiled: February 21, 2017Publication date: August 23, 2018Inventors: NEGAR KOOCHAKZADEH, NITIN KUNAL, SAM IDICULA, CAGRI BALKESEN, NIPUN AGARWAL