Patents by Inventor Jay Sudrik

Jay Sudrik 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: 10922297
    Abstract: A system for an in-memory row storage architecture can be provided. In some implementations, the system performs operations including processing a database statement comprising a first database transaction affecting one or more rows in an in-memory row store, registering the database statement at a start of execution of the database statement, the start of execution occurring at a first time, unregistering the registered database statement at an end of execution of the database statement, determining a second time at which execution of an oldest currently registered database statement was started, assigning a garbage collection thread to a second database transaction committed at a third time and affecting at least one row of the plurality of rows, and activating the garbage collection thread to reclaim memory within the in-memory row store when the third time is less than the second time. Related systems, methods, and articles of manufacture are also described.
    Type: Grant
    Filed: February 28, 2018
    Date of Patent: February 16, 2021
    Assignee: SAP SE
    Inventors: Rahul Mittal, Amit Pathak, Jay Sudrik, Simhachala Sasikanth Gottapu
  • Patent number: 10503699
    Abstract: Disclosed herein are system, method, and computer program product embodiments for synchronizing an unsynchronized distributed database system. An embodiment operates by locking, by a second node, partitions in the second node based on first information received from, a first node responsive to execution of partition utility based on a first query received by the first node. Blocking, by the second node, a second query to a data portion of the partitions in the second node based on the first information. Locking, by the second node, second node object metadata based on second information received from the first node. Receiving, by the second node, changes to first node object metadata and applying the changes to the second node object metadata. Unlocking, by the second node, the partitions in the second node and the second node object metadata while unblocking the second query.
    Type: Grant
    Filed: April 25, 2016
    Date of Patent: December 10, 2019
    Assignee: SAP SE
    Inventors: Gaurav Kumar Gupta, Souvik Pal, Amit Pathak, Jay Sudrik
  • Patent number: 10346384
    Abstract: Example embodiments of a database employing an efficient form of multi-version concurrency control (MVCC) are described. In an example embodiment, in response to receiving an update command for a first row of a plurality of rows of a database, an image of the first row stored in a first memory area is stored in a second memory area. In a third memory area storing a first database structure and associated pointer corresponding to the image of the first row stored in the first memory area, a second data structure and associated pointer corresponding to the image of the first row in the second memory area are stored. The second data structure is linked to the first data structure. The image of the first row in the first memory area is overwritten with an image of a new version of the first row provided in the update command.
    Type: Grant
    Filed: November 22, 2016
    Date of Patent: July 9, 2019
    Assignee: SAP SE
    Inventors: Rahul Mittal, Jay Sudrik, Amit Pathak
  • Publication number: 20180349270
    Abstract: A system for an in-memory row storage architecture can be provided. In some implementations, the system performs operations including processing a database statement comprising a first database transaction affecting one or more rows in an in-memory row store, registering the database statement at a start of execution of the database statement, the start of execution occurring at a first time, unregistering the registered database statement at an end of execution of the database statement, determining a second time at which execution of an oldest currently registered database statement was started, assigning a garbage collection thread to a second database transaction committed at a third time and affecting at least one row of the plurality of rows, and activating the garbage collection thread to reclaim memory within the in-memory row store when the third time is less than the second time. Related systems, methods, and articles of manufacture are also described.
    Type: Application
    Filed: February 28, 2018
    Publication date: December 6, 2018
    Inventors: Rahul Mittal, Amit Pathak, Jay Sudrik, Simhachala Sasikanth Gottapu
  • Patent number: 10013347
    Abstract: A transaction descriptor associated with a vertical chain of row versions is received. The vertical chain of row versions is traversed. The vertical chain is part of a grid structure formed by a number of vertical chains intersected with a number of horizontal chains. A link to a current row version is terminated. A link from the current row version to an older row version in a horizontal chain is locally stored and terminated. The older row version is set as ready for garbage collection. The current row version is set as ready for garbage collection. A link from the current row version to a next row version in the horizontal chain is locally stored and terminated. The next row version is appointed as current.
    Type: Grant
    Filed: October 27, 2015
    Date of Patent: July 3, 2018
    Assignee: SYBASE, INC.
    Inventors: Rahul Mittal, Amit Pathak, Jay Sudrik, Simhachala Sasikanth Gottapu
  • Publication number: 20170308547
    Abstract: Disclosed herein are system, method, and computer program product embodiments for synchronizing an unsynchronized distributed database system. An embodiment operates by locking, by a second node, partitions in the second node based on first information received from, a first node responsive to execution of partition utility based on a first query received by the first node. Blocking, by the second node, a second query to a data portion of the partitions in the second node based on the first information. Locking, by the second node, second node object metadata based on second information received from the first node. Receiving, by the second node, changes to first node object metadata and applying the changes to the second node object metadata. Unlocking, by the second node, the partitions in the second node and the second node object metadata while unblocking the second query.
    Type: Application
    Filed: April 25, 2016
    Publication date: October 26, 2017
    Inventors: Gaurav Kumar GUPTA, Souvik Pal, Amit Pathak, Jay Sudrik
  • Publication number: 20170116116
    Abstract: A transaction descriptor associated with a vertical chain of row versions is received. The vertical chain of row versions is traversed. The vertical chain is part of a grid structure formed by a number of vertical chains intersected with a number of horizontal chains. A link to a current row version is terminated. A link from the current row version to an older row version in a horizontal chain is locally stored and terminated. The older row version is set as ready for garbage collection. The current row version is set as ready for garbage collection. A link from the current row version to a next row version in the horizontal chain is locally stored and terminated. The next row version is appointed as current.
    Type: Application
    Filed: October 27, 2015
    Publication date: April 27, 2017
    Inventors: Rahul Mittal, Amit Pathak, Jay Sudrik, Simhachala Sasikanth Gottapu