Patents by Inventor Sunil K. Sarin

Sunil K. Sarin 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: 10282349
    Abstract: In an approach to storing data elements in a database, a database management unit provides a table-mapping file for enabling access to a table of a plurality of tables in a storage medium, the table-mapping file comprising a plurality of map records of a single table, a map record comprising information indicative of the table, a column of the table, a data section of the table, and a range of values of data elements included in the data section of the column. The unit receives a data element at the database via a communication interface, determines the table, column, and data section the data element is to be stored in, and stores the data element in the section file corresponding to the determined table, column and data section. The unit then updates the table-mapping file corresponding to the table, columns and data section the data element has been stored in.
    Type: Grant
    Filed: August 26, 2015
    Date of Patent: May 7, 2019
    Assignee: International Business Machines Corporation
    Inventors: Gordon A. Booman, James L. Finnie, Oliver Koeth, Sunil K. Sarin
  • Patent number: 10261862
    Abstract: According to an aspect, a database management system (DBMS) is operated to perform data replication. The DBMS includes a source database and a target database. The source database includes a plurality of first tables respectively comprising one or more first columns, and the target database includes a plurality of second tables respectively comprising one or more second columns. Each of multiple ones of the first columns is mapped to one of the second columns, and each one of the second columns is adapted to store replicated data changes of the first column mapped to the second column. Each of the second columns has an assigned update time, the update time being a moment in time when the second column most recently received incremental data changes from its mapped first column. The DBMS operates to process requested database statements while providing data replication.
    Type: Grant
    Filed: November 22, 2017
    Date of Patent: April 16, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Namik Hrle, Daniel Martin, Chandrasekaran Mohan, Sunil K. Sarin, James D. Spyker, Yongfeng Yao
  • Patent number: 10255234
    Abstract: In an approach to storing data elements in a database, a database management unit provides a table-mapping file for enabling access to a table of a plurality of tables in a storage medium, the table-mapping file comprising a plurality of map records of a single table, a map record comprising information indicative of the table, a column of the table, a data section of the table, and a range of values of data elements included in the data section of the column. The unit receives a data element at the database via a communication interface, determines the table, column, and data section the data element is to be stored in, and stores the data element in the section file corresponding to the determined table, column and data section. The unit then updates the table-mapping file corresponding to the table, columns and data section the data element has been stored in.
    Type: Grant
    Filed: May 24, 2016
    Date of Patent: April 9, 2019
    Assignee: International Business Machine Corporation
    Inventors: Gordon A. Booman, James L. Finnie, Oliver Koeth, Sunil K. Sarin
  • Patent number: 10204130
    Abstract: A method, a processing device, and a computer program product are provided. A truncate table command for truncating all or a subset of one or more rows of a database table is received from a first transaction executing on a processing device. At least one read operation on the truncated database table is performed for at least one transaction concurrent with the first transaction, wherein the truncated rows are visible to the at least one concurrent transaction and invisible to subsequent transactions. Storage units that store the truncated rows are reclaimed in response to completion of the at least one concurrent transaction.
    Type: Grant
    Filed: March 23, 2016
    Date of Patent: February 12, 2019
    Assignee: International Business Machines Corporation
    Inventors: Praveen Mohandas, Sunil K. Sarin, Knut Stolze
  • Patent number: 9990224
    Abstract: Consistency of replicated data copies with statement-based replication is provided without requiring transaction serializability. At a subordinate replication node, a transaction start message, replicated data modification statements, and a transaction commit message are received for a next committed transaction from a master replication node, wherein the transaction start message carries a master transaction identifier, an invisibility list consisting of identifiers of other master transactions that had started and not yet committed when this master transaction started, and an earliest invisible master transaction identifier. The master transaction identifier, invisibility list, and earliest invisible transaction identifier are mapped to subordinate transaction identifiers to preserve an order of transaction identifiers from the master replication node.
    Type: Grant
    Filed: February 23, 2015
    Date of Patent: June 5, 2018
    Assignee: International Business Machines Corporation
    Inventors: Thomas P. Boldt, Sunil K. Sarin, Dirk A. Seelemann, II, Glenn P. Steffler
  • Patent number: 9990225
    Abstract: Consistency of replicated data copies with statement-based replication is provided without requiring transaction serializability. At a subordinate replication node, a transaction start message, replicated data modification statements, and a transaction commit message are received for a next committed transaction from a master replication node, wherein the transaction start message carries a master transaction identifier, an invisibility list consisting of identifiers of other master transactions that had started and not yet committed when this master transaction started, and an earliest invisible master transaction identifier. The master transaction identifier, invisibility list, and earliest invisible transaction identifier are mapped to subordinate transaction identifiers to preserve an order of transaction identifiers from the master replication node.
    Type: Grant
    Filed: April 24, 2015
    Date of Patent: June 5, 2018
    Assignee: International Business Machines Corporation
    Inventors: Thomas P. Boldt, Sunil K. Sarin, Dirk A. Seelemann, II, Glenn P. Steffler
  • Publication number: 20180095829
    Abstract: According to an aspect, a database management system (DBMS) is operated to perform data replication. The DBMS includes a source database and a target database. The source database includes a plurality of first tables respectively comprising one or more first columns, and the target database includes a plurality of second tables respectively comprising one or more second columns. Each of multiple ones of the first columns is mapped to one of the second columns, and each one of the second columns is adapted to store replicated data changes of the first column mapped to the second column. Each of the second columns has an assigned update time, the update time being a moment in time when the second column most recently received incremental data changes from its mapped first column. The DBMS operates to process requested database statements while providing data replication.
    Type: Application
    Filed: November 22, 2017
    Publication date: April 5, 2018
    Inventors: Namik Hrle, Daniel Martin, Chandrasekaran Mohan, Sunil K. Sarin, James D. Spyker, Yongfeng Yao
  • Patent number: 9886347
    Abstract: According to an aspect, a database management system (DBMS) is operated to perform data replication. The DBMS includes a source database and a target database. The source database includes a plurality of first tables respectively comprising one or more first columns, and the target database includes a plurality of second tables respectively comprising one or more second columns. Each of multiple ones of the first columns is mapped to one of the second columns, and each one of the second columns is adapted to store replicated data changes of the first column mapped to the second column. Each of the second columns has an assigned update time, the update time being a moment in time when the second column most recently received incremental data changes from its mapped first column. The DBMS operates to process requested database statements while providing data replication.
    Type: Grant
    Filed: January 8, 2015
    Date of Patent: February 6, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Namik Hrle, Daniel Martin, Chandrasekaran Mohan, Sunil K. Sarin, James D. Spyker, Yongfeng Yao
  • Publication number: 20170277741
    Abstract: A method, a processing device, and a computer program product are provided. A truncate table command for truncating all or a subset of one or more rows of a database table is received from a first transaction executing on a processing device. At least one read operation on the truncated database table is performed for at least one transaction concurrent with the first transaction, wherein the truncated rows are visible to the at least one concurrent transaction and invisible to subsequent transactions. Storage units that store the truncated rows are reclaimed in response to completion of the at least one concurrent transaction.
    Type: Application
    Filed: April 7, 2017
    Publication date: September 28, 2017
    Inventors: Praveen Mohandas, Sunil K. Sarin, Knut Stolze
  • Publication number: 20170277744
    Abstract: A method, a processing device, and a computer program product are provided. A truncate table command for truncating all or a subset of one or more rows of a database table is received from a first transaction executing on a processing device. At least one read operation on the truncated database table is performed for at least one transaction concurrent with the first transaction, wherein the truncated rows are visible to the at least one concurrent transaction and invisible to subsequent transactions. Storage units that store the truncated rows are reclaimed in response to completion of the at least one concurrent transaction.
    Type: Application
    Filed: March 23, 2016
    Publication date: September 28, 2017
    Inventors: Praveen Mohandas, Sunil K. Sarin, Knut Stolze
  • Publication number: 20170060890
    Abstract: In an approach to storing data elements in a database, a database management unit provides a table-mapping file for enabling access to a table of a plurality of tables in a storage medium, the table-mapping file comprising a plurality of map records of a single table, a map record comprising information indicative of the table, a column of the table, a data section of the table, and a range of values of data elements included in the data section of the column. The unit receives a data element at the database via a communication interface, determines the table, column, and data section the data element is to be stored in, and stores the data element in the section file corresponding to the determined table, column and data section. The unit then updates the table-mapping file corresponding to the table, columns and data section the data element has been stored in.
    Type: Application
    Filed: August 26, 2015
    Publication date: March 2, 2017
    Inventors: Gordon A. Booman, James L. Finnie, Oliver Koeth, Sunil K. Sarin
  • Publication number: 20170060908
    Abstract: In an approach to storing data elements in a database, a database management unit provides a table-mapping file for enabling access to a table of a plurality of tables in a storage medium, the table-mapping file comprising a plurality of map records of a single table, a map record comprising information indicative of the table, a column of the table, a data section of the table, and a range of values of data elements included in the data section of the column. The unit receives a data element at the database via a communication interface, determines the table, column, and data section the data element is to be stored in, and stores the data element in the section file corresponding to the determined table, column and data section. The unit then updates the table-mapping file corresponding to the table, columns and data section the data element has been stored in.
    Type: Application
    Filed: May 24, 2016
    Publication date: March 2, 2017
    Inventors: Gordon A. Booman, James L. Finnie, Oliver Koeth, Sunil K. Sarin
  • Publication number: 20160246836
    Abstract: Consistency of replicated data copies with statement-based replication is provided without requiring transaction serializability. At a subordinate replication node, a transaction start message, replicated data modification statements, and a transaction commit message are received for a next committed transaction from a master replication node, wherein the transaction start message carries a master transaction identifier, an invisibility list consisting of identifiers of other master transactions that had started and not yet committed when this master transaction started, and an earliest invisible master transaction identifier. The master transaction identifier, invisibility list, and earliest invisible transaction identifier are mapped to subordinate transaction identifiers to preserve an order of transaction identifiers from the master replication node.
    Type: Application
    Filed: February 23, 2015
    Publication date: August 25, 2016
    Inventors: Thomas P. Boldt, Sunil K. Sarin, Dirk A. Seelemann, II, Glenn P. Steffler
  • Publication number: 20160246864
    Abstract: Consistency of replicated data copies with statement-based replication is provided without requiring transaction serializability. At a subordinate replication node, a transaction start message, replicated data modification statements, and a transaction commit message are received for a next committed transaction from a master replication node, wherein the transaction start message carries a master transaction identifier, an invisibility list consisting of identifiers of other master transactions that had started and not yet committed when this master transaction started, and an earliest invisible master transaction identifier. The master transaction identifier, invisibility list, and earliest invisible transaction identifier are mapped to subordinate transaction identifiers to preserve an order of transaction identifiers from the master replication node.
    Type: Application
    Filed: April 24, 2015
    Publication date: August 25, 2016
    Inventors: Thomas P. Boldt, Sunil K. Sarin, Dirk A. Seelemann, II, Glenn P. Steffler
  • Publication number: 20160203050
    Abstract: According to an aspect, a database management system (DBMS) is operated to perform data replication. The DBMS includes a source database and a target database. The source database includes a plurality of first tables respectively comprising one or more first columns, and the target database includes a plurality of second tables respectively comprising one or more second columns. Each of multiple ones of the first columns is mapped to one of the second columns, and each one of the second columns is adapted to store replicated data changes of the first column mapped to the second column. Each of the second columns has an assigned update time, the update time being a moment in time when the second column most recently received incremental data changes from its mapped first column. The DBMS operates to process requested database statements while providing data replication.
    Type: Application
    Filed: January 8, 2015
    Publication date: July 14, 2016
    Inventors: Namik Hrle, Daniel Martin, Chandrasekaran Mohan, Sunil K. Sarin, James D. Spyker, Yongfeng Yao
  • Patent number: 7305386
    Abstract: A multi-version database system controls visibility of data during transaction processing. A transaction includes a transaction identifier that identifies the transaction and an invisibility list of transactions whose effects are invisible to the transaction. Changes made by other transactions are visible to the transaction based on the isolation level of the transaction. Records are visible to a transaction based on a creator identifier stored in the record that identifies the transaction that created the record.
    Type: Grant
    Filed: August 22, 2003
    Date of Patent: December 4, 2007
    Assignee: Netezza Corporation
    Inventors: Foster D. Hinshaw, Craig S. Harris, Sunil K. Sarin
  • Patent number: 7146366
    Abstract: A mechanism controls concurrency among database transactions through the use of serial ordering relations. The ordering relations are computed dynamically in response to patterns of use. An embodiment of the present invention serializes a transaction that accesses a resource before a transaction that modifies the resource, even if the accessor starts after the modifier starts or commits after the modifier commits. A method of concurrency control for a database transaction in a distributed database system stores an intended use of a database system resource by the database transaction in a serialization graph. A serialization ordering is asserted between the database transaction and other database transactions based on the intended use of the database system resource by the database transaction. The serialization ordering is then communicated to a node in the distributed database system that needs to know the serialization ordering to perform concurrency control.
    Type: Grant
    Filed: September 2, 2003
    Date of Patent: December 5, 2006
    Assignee: Netezza Corporation
    Inventors: Foster D. Hinshaw, Craig S. Harris, Sunil K. Sarin
  • Patent number: 7089253
    Abstract: A mechanism controls concurrency among database transactions through the use of serial ordering relations. The ordering relations are computed dynamically in response to patterns of use. An embodiment of the present invention serializes a transaction that accesses a resource before a transaction that modifies the resource, even if the accessor starts after the modifier starts or commits after the modifier commits. A method of concurrency control for a database transaction in a distributed database system stores an intended use of a database system resource by the database transaction in a serialization graph. A serialization ordering is asserted between the database transaction and other database transactions based on the intended use of the database system resource by the database transaction. The serialization ordering is then communicated to a node in the distributed database system that needs to know the serialization ordering to perform concurrency control.
    Type: Grant
    Filed: September 2, 2003
    Date of Patent: August 8, 2006
    Assignee: Netezza Corporation
    Inventors: Foster D. Hinshaw, Craig S. Harris, Sunil K. Sarin
  • Publication number: 20040249838
    Abstract: A multi-version database system controls visibility of data during transaction processing. A transaction includes a transaction identifier that identifies the transaction and an invisibility list of transactions whose effects are invisible to the transaction. Changes made by other transactions are visible to the transaction based on the isolation level of the transaction. Records are visible to a transaction based on a creator identifier stored in the record that identifies the transaction that created the record.
    Type: Application
    Filed: August 22, 2003
    Publication date: December 9, 2004
    Applicant: Netezza Corporation
    Inventors: Foster D. Hinshaw, Craig S. Harris, Sunil K. Sarin
  • Publication number: 20040078379
    Abstract: A mechanism controls concurrency among database transactions through the use of serial ordering relations. The ordering relations are computed dynamically in response to patterns of use. An embodiment of the present invention serializes a transaction that accesses a resource before a transaction that modifies the resource, even if the accessor starts after the modifier starts or commits after the modifier commits. A method of concurrency control for a database transaction in a distributed database system stores an intended use of a database system resource by the database transaction in a serialization graph. A serialization ordering is asserted between the database transaction and other database transactions based on the intended use of the database system resource by the database transaction. The serialization ordering is then communicated to a node in the distributed database system that needs to know the serialization ordering to perform concurrency control.
    Type: Application
    Filed: September 2, 2003
    Publication date: April 22, 2004
    Applicant: Netezza Corporation
    Inventors: Foster D. Hinshaw, Craig S. Harris, Sunil K. Sarin