Patents by Inventor Manjula Koppuravuri
Manjula Koppuravuri 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: 11409739Abstract: In some examples, a database system includes a storage medium to store a materialized view (MV) that includes data satisfying an MV condition. At least one processor is to receive a query including a query condition, determine that the query condition partially matches the MV condition, and access a part of the data in the MV partially satisfy the query.Type: GrantFiled: December 23, 2019Date of Patent: August 9, 2022Assignee: Teradata US, Inc.Inventors: Manjula Koppuravuri, Rangavajjula K N Sai Krishna, Chandrasekhar Tekur, Michael Warren Watzke
-
Publication number: 20210089529Abstract: In some examples, a database system includes a storage medium to store a materialized view (MV) that includes data satisfying an MV condition. At least one processor is to receive a query including a query condition, determine that the query condition partially matches the MV condition, and access a part of the data in the MV to partially satisfy the query.Type: ApplicationFiled: December 23, 2019Publication date: March 25, 2021Inventors: Manjula Koppuravuri, Rangavajjula K N Sai Krishna, Chandrasekhar Tekur, Michael Warren Watzke
-
Patent number: 10810188Abstract: A database table is defined as a load isolated table (LDI table) that supports a current table version number, multiple row versions, and special load protocols. An isolated loading statement on the LDI table is identified in a Data Manipulation Language (DML), causing the table to be placed in an isolated loading state associated with an incremented new value of the table's current version number. A designated group of DML operations in one or more sessions are then used to load/modify rows in the table, and affected rows are marked with the uncommitted new version. Read-committed queries supported for LDIs ignore the uncommitted rows during an isolated load, seeing only previously committed versions of the rows. When an end isolated loading on the table is identified, the table's version is updated to the new incremented value, causing the newly loaded/modified rows to be recognized as committed by subsequent read-committed queries.Type: GrantFiled: November 29, 2017Date of Patent: October 20, 2020Assignee: Teradata US, Inc.Inventors: Manjula Koppuravuri, James Ronald Carlson
-
Publication number: 20190163753Abstract: A database table is defined as a load isolated table (LDI table) that supports a current table version number, multiple row versions, and special load protocols. An isolated loading statement on the LDI table is identified in a Data Manipulation Language (DML), causing the table to be placed in an isolated loading state associated with an incremented new value of the table's current version number. A designated group of DML operations in one or more sessions are then used to load/modify rows in the table, and affected rows are marked with the uncommitted new version. Read-committed queries supported for LDIs ignore the uncommitted rows during an isolated load, seeing only previously committed versions of the rows. When an end isolated loading on the table is identified, the table's version is updated to the new incremented value, causing the newly loaded/modified rows to be recognized as committed by subsequent read-committed queries.Type: ApplicationFiled: November 29, 2017Publication date: May 30, 2019Inventors: Manjula Koppuravuri, James Ronald Carlson
-
Patent number: 9430526Abstract: A method, database system and computer program are disclosed for optimizing a SQL query, in which the SQL query seeks to aggregate temporal database information. The method includes determining whether two rows of information have a common grouping value, and if so, determining both temporal overlap and temporal non-overlap components of the two rows, aggregating each of the temporal overlap components of the two rows, and separating the temporal non-overlap components of the two rows.Type: GrantFiled: September 29, 2008Date of Patent: August 30, 2016Assignee: Teradata US, Inc.Inventors: Bhashyam Ramesh, Manjula Koppuravuri
-
Patent number: 8666956Abstract: A SEQUENCED request a) to apply a temporal Source table to a temporal Target table under a predicate is received. The Source table includes a plurality of rows that qualify to apply to a single Target table row under the predicate. The predicate specifies a Source table join column. Each of the plurality of Source table rows and the single Target table row include a ValidTime dimension. The plurality of Source table rows is b) ordered by the Source table join column and a period-to-be-modified. The next of the ordered plurality of Source table rows is c) applied by determining that the Target table row has a TransactionTime and, in response, closing out the TransactionTime of the Target table row. Applying the next of the ordered plurality of Source table rows includes identifying an RDIFF range as the period-to-be-modified of the Source table row being applied that is later than the ValidTime range of the single Target table row.Type: GrantFiled: December 16, 2010Date of Patent: March 4, 2014Assignee: Teradata US, Inc.Inventors: Bhashyam Ramesh, Manjula Koppuravuri
-
Patent number: 8621482Abstract: A method, computer program, and database system are disclosed. A plurality of instances of a request to a database system are received. All instances of the request have a same set of variables to use in executing the request. The values of the variables are supplied by data in a data source. A specific plan for executing one instance of the request is generated. Generating the specific plan includes taking into account data in the data source. The specific plan is executed on the database system. A system run-time metric and a parsing time for executing the specific plan are captured and saved. A generic plan is generated and cached based on a comparison of the system run-time metric and the parsing time for executing the specific plan.Type: GrantFiled: September 5, 2008Date of Patent: December 31, 2013Assignee: Teradata US, Inc.Inventors: Bhashyam Ramesh, Donald Pederson, Manjula Koppuravuri
-
Patent number: 8335772Abstract: A method, system, and computer program for optimizing execution of a DML statement on a temporal database are disclosed. A first execution package is provided to an execution engine. The first execution package includes a plurality of operations to be executed if the contents of a row in a table in the temporal database indicate the row has a first temporal condition. A second execution package is provided to the execution engine. The second execution package includes a plurality of operations to be executed if the contents of the row in the table in the temporal database indicate the row has a second temporal condition. The execution engine is run to produce a result. The result is saved.Type: GrantFiled: November 12, 2008Date of Patent: December 18, 2012Assignee: Teradata US, Inc.Inventors: Bhashyam Ramesh, Manjula Koppuravuri
-
Patent number: 8301934Abstract: A base table temporal row affected by a transaction is timestamped. The temporal row has a row ID. The temporal row in the base table is modified according to the transaction. The row ID for the modified temporal row is associated with an identifier for the transaction in a temporal work table. Upon committing the transaction: the temporal work table is searched to determine the row ID of the temporal row modified by the transaction, and a commit-time is saved into the temporal row identified by the row ID.Type: GrantFiled: April 17, 2009Date of Patent: October 30, 2012Assignee: Teradata US, Inc.Inventors: Bhashyam Ramesh, Manjula Koppuravuri
-
Patent number: 8250064Abstract: A computer system programmed as a database receives a query Q1. Q1 includes a predicate. The predicate includes a reference to a current timestamp of time TT1. The database has R data structures. The computer system creates a plan, Plan 1, to execute Q1. Plan 1 includes the identification of a first set of data structures, P1, to be accessed in executing Plan 1, at the current timestamp of time TT1. The number of data structures in P1 is less than R. The computer system determines that Plan 1 is valid for a period of time. The computer system stores in a cache Plan 1 and an indication that Plan 1 is valid for the period of time.Type: GrantFiled: April 6, 2010Date of Patent: August 21, 2012Assignee: Teradata US, Inc.Inventors: Bhashyam Ramesh, Manjula Koppuravuri
-
Patent number: 8214408Abstract: A method, database system and computer program are disclosed for performing a temporal join between two temporal database tables. The method includes determining a selected table intersection between a period of interest and a time period value for a selected table row, scanning an inner table for a row that matches the selected table on the join conditions and overlaps the selected table intersection, and determining the remainder time period values from the selected table intersection.Type: GrantFiled: September 29, 2008Date of Patent: July 3, 2012Assignee: Teradata US, Inc.Inventors: Bhashyam Ramesh, Manjula Koppuravuri, Chandrasekhar Tekur
-
Patent number: 7962521Abstract: An index selection mechanism allows for efficient generation of index recommendations for a given workload of a database system. The workload includes a set of queries that are used to access tables in a database system. The index recommendations are validated to verify improved performance, followed by application of the indexes. Graphical user interface screens are provided to receive user input as well as to present reports to the user.Type: GrantFiled: March 2, 2009Date of Patent: June 14, 2011Assignee: Teradata US, Inc.Inventors: Douglas P. Brown, Jeetendra Chaware, Manjula Koppuravuri
-
Publication number: 20100082601Abstract: A method, database system and computer program are disclosed for performing a temporal join between two temporal database tables. The method includes determining a selected table intersection between a period of interest and a time period value for a selected table row, scanning an inner table for a row that matches the selected table on the join conditions and overlaps the selected table intersection, and determining the remainder time period values from the selected table intersection.Type: ApplicationFiled: September 29, 2008Publication date: April 1, 2010Inventors: Bhashyam Ramesh, Manjula Koppuravuri, Chandrasekhar Tekur
-
Publication number: 20100082705Abstract: A method, database system and computer program are disclosed for optimizing a SQL query, in which the SQL query seeks to aggregate temporal database information. The method includes determining whether two rows of information have a common grouping value, and if so, determining both temporal overlap and temporal non-overlap components of the two rows, aggregating each of the temporal overlap components of the two rows, and separating the temporal non-overlap components of the two rows.Type: ApplicationFiled: September 29, 2008Publication date: April 1, 2010Inventors: Bhashyam Ramesh, Manjula Koppuravuri
-
Publication number: 20100057796Abstract: An index selection mechanism allows for efficient generation of index recommendations for a given workload of a database system. The workload includes a set of queries that are used to access tables in a database system. The index recommendations are validated to verify improved performance, followed by application of the indexes. Graphical user interface screens are provided to receive user input as well as to present reports to the user.Type: ApplicationFiled: March 2, 2009Publication date: March 4, 2010Inventors: Douglas P. Brown, Jeetendra Chaware, Manjula Koppuravuri
-
Patent number: 7499907Abstract: An index selection mechanism allows for efficient generation of index recommendations for a given workload of a database system. The workload includes a set of queries that are used to access tables in a database system. The index recommendations are validated to verify improved performance, followed by application of the indexes. Graphical user interface screens are provided to receive user input as well as to present reports to the user.Type: GrantFiled: October 12, 2001Date of Patent: March 3, 2009Assignee: Teradata US, Inc.Inventors: Douglas P. Brown, Jeetendra Chaware, Manjula Koppuravuri
-
Publication number: 20030093408Abstract: An index selection mechanism allows for efficient generation of index recommendations for a given workload of a database system. The workload includes a set of queries that are used to access tables in a database system. The index recommendations are validated to verify improved performance, followed by application of the indexes. Graphical user interface screens are provided to receive user input as well as to present reports to the user.Type: ApplicationFiled: October 12, 2001Publication date: May 15, 2003Inventors: Douglas P. Brown, Jeetendra Chaware, Manjula Koppuravuri