Patents by Inventor Vasudha Krishnaswamy

Vasudha Krishnaswamy 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: 10747752
    Abstract: Embodiments store transaction metadata in dedicated pools of allocated memory chunks. Portions of the pools of allocated memory chunks are dedicated to the respective apply slave processes that mine and process change records. Also, the pools of allocated memory chunks are anchored within the structure of a transaction log such that buffering and application of metadata for one transaction does not block required buffering and application of metadata for other transactions. The standby database system pre-processes transaction metadata in preparation for application of the metadata to invalidate appropriate portions of MF data. Further, embodiments divide the work of pre-processing invalidation records among the many apply slave processes that record the invalidation records. A garbage collection selects memory chunks for garbage collection in reverse order of how the chunks were allocated.
    Type: Grant
    Filed: February 9, 2018
    Date of Patent: August 18, 2020
    Assignee: Oracle International Corporation
    Inventors: Vasudha Krishnaswamy, Kartik Kulkarni, Sukhada Pendse, Akshay Kulkarni
  • Patent number: 10474653
    Abstract: Techniques are described herein for distributing distinct portions of a database object across volatile memories of selected nodes of a plurality of nodes in a clustered database system. The techniques involve storing a unit-to-service mapping that associates a unit (a database object or portion thereof) to one or more database services. The one or more database services are mapped to one or more nodes. The nodes to which a service is mapped may include nodes in disjoint database systems, so long as those database systems have access to a replica of the unit. The database object is treated as in-memory enabled by nodes that are associated with the service, and are treated as not in-memory enabled by nodes that are not associated with the service.
    Type: Grant
    Filed: September 30, 2016
    Date of Patent: November 12, 2019
    Assignee: Oracle International Corporation
    Inventors: Niloy Mukherjee, Jesse Kamp, Tirthankar Lahiri, Maria Colgan, Vivekanandhan Raja, Vasudha Krishnaswamy, Aditi Gupta, Kartik Kulkarni
  • Patent number: 10372699
    Abstract: Techniques are described for maintaining coherency of a portion of a database object populated in the volatile memories of multiple nodes in a database cluster. The techniques involve maintaining a local invalidation bitmap for which identifies block-level invalidity data and item-level invalidity data. In response to detecting a patch-up triggering event, a particular node identifies, in the block-level invalidity data, blocks that have been marked as invalid. For each block that has been marked as invalid, the node identifies specific items that have changed and marks the items as invalid in the item-level invalidity data. The node then updates the block-level invalidity data to indicate that the blocks are no longer invalid.
    Type: Grant
    Filed: September 14, 2016
    Date of Patent: August 6, 2019
    Assignee: Oracle International Corporation
    Inventors: Xiaoming He, Solmaz Kolahi, Vivekanandhan Raja, Tirthankar Lahiri, Vasudha Krishnaswamy, Sanket Hase
  • Patent number: 10303788
    Abstract: A minimum value (MV) is computed for start timestamps that each correspond to an uncommitted transaction. In an embodiment, the MV is computed for a pluggable database that is open on at least first and second instances of a database. The MV is computed for the first instance as of a first current timestamp (CT). The MV and the first CT are communicated to a second instance that has a second CT. If the first and second CTs are equal, the second instance store the MV. If the first CT is bigger, the second CT also becomes equal to the first CT. If the first CT is smaller, the MV is discarded, and the first CT becomes equal to the second CT. In an embodiment, if the MV remains unchanged for a predetermined time period, a start timestamp corresponding to the MV is advanced to a current or future timestamp.
    Type: Grant
    Filed: August 31, 2016
    Date of Patent: May 28, 2019
    Assignee: Oracle International Corporation
    Inventors: Kartik Kulkarni, Juan R. Loaiza, Vivekanandhan Raja, Kothanda Umamageswaran, Sanket Hase, Vasudha Krishnaswamy, Tirthankar Lahiri
  • Patent number: 10248685
    Abstract: A minimum value (MV) is computed for start timestamps that each correspond to an uncommitted transaction. In an embodiment, the MV is computed for a pluggable database that is open on at least first and second instances of a database. The MV is computed for the first instance as of a first current timestamp (CT). The MV and the first CT are communicated to a second instance that has a second CT. If the first and second CTs are equal, the second instance store the MV. If the first CT is bigger, the second CT also becomes equal to the first CT. If the first CT is smaller, the MV is discarded, and the first CT becomes equal to the second CT. In an embodiment, if the MV remains unchanged for a predetermined time period, a start timestamp corresponding to the MV is advanced to a current or future timestamp.
    Type: Grant
    Filed: August 31, 2016
    Date of Patent: April 2, 2019
    Assignee: Oracle International Corporation
    Inventors: Kartik Kulkarni, Juan R. Loaiza, Vivekanandhan Raja, Kothanda Umamageswaran, Sanket Hase, Vasudha Krishnaswamy, Tirthankar Lahiri
  • Publication number: 20180165324
    Abstract: Embodiments store transaction metadata in dedicated pools of allocated memory chunks. Portions of the pools of allocated memory chunks are dedicated to the respective apply slave processes that mine and process change records. Also, the pools of allocated memory chunks are anchored within the structure of a transaction log such that buffering and application of metadata for one transaction does not block required buffering and application of metadata for other transactions. The standby database system pre-processes transaction metadata in preparation for application of the metadata to invalidate appropriate portions of MF data. Further, embodiments divide the work of pre-processing invalidation records among the many apply slave processes that record the invalidation records. A garbage collection selects memory chunks for garbage collection in reverse order of how the chunks were allocated.
    Type: Application
    Filed: February 9, 2018
    Publication date: June 14, 2018
    Inventors: Vasudha Krishnaswamy, Kartik Kulkarni, Sukhada Pendse, Akshay Kulkarni
  • Publication number: 20180096010
    Abstract: Techniques are described herein for distributing distinct portions of a database object across volatile memories of selected nodes of a plurality of nodes in a clustered database system. The techniques involve storing a unit-to-service mapping that associates a unit (a database object or portion thereof) to one or more database services. The one or more database services are mapped to one or more nodes. The nodes to which a service is mapped may include nodes in disjoint database systems, so long as those database systems have access to a replica of the unit. The database object is treated as in-memory enabled by nodes that are associated with the service, and are treated as not in-memory enabled by nodes that are not associated with the service.
    Type: Application
    Filed: September 30, 2016
    Publication date: April 5, 2018
    Inventors: Niloy Mukherjee, Jesse Kamp, Tirthankar Lahiri, Maria Colgan, Vivekanandhan Raja, Vasudha Krishnaswamy, Aditi Gupta, Kartik Kulkarni
  • Publication number: 20180075079
    Abstract: Techniques are described for maintaining coherency of a portion of a database object populated in the volatile memories of multiple nodes in a database cluster. The techniques involve maintaining a local invalidation bitmap for which identifies block-level invalidity data and item-level invalidity data. In response to detecting a patch-up triggering event, a particular node identifies, in the block-level invalidity data, blocks that have been marked as invalid. For each block that has been marked as invalid, the node identifies specific items that have changed and marks the items as invalid in the item-level invalidity data. The node then updates the block-level invalidity data to indicate that the blocks are no longer invalid.
    Type: Application
    Filed: September 14, 2016
    Publication date: March 15, 2018
    Inventors: Xiaoming He, Solmaz Kolahi, Vivekanandhan Raja, Tirthankar Lahiri, Vasudha Krishnaswamy, Sanket Hase
  • Publication number: 20180060377
    Abstract: A minimum value (MV) is computed for start timestamps that each correspond to an uncommitted transaction. In an embodiment, the MV is computed for a pluggable database that is open on at least first and second instances of a database. The MV is computed for the first instance as of a first current timestamp (CT). The MV and the first CT are communicated to a second instance that has a second CT. If the first and second CTs are equal, the second instance store the MV. If the first CT is bigger, the second CT also becomes equal to the first CT. If the first CT is smaller, the MV is discarded, and the first CT becomes equal to the second CT. In an embodiment, if the MV remains unchanged for a predetermined time period, a start timestamp corresponding to the MV is advanced to a current or future timestamp.
    Type: Application
    Filed: August 31, 2016
    Publication date: March 1, 2018
    Inventors: Kartik Kulkarni, Juan R. Loaiza, Vivekanandhan Raja, Kothanda Umamageswaran, Sanket Hase, Vasudha Krishnaswamy, Tirthankar Lahiri
  • Publication number: 20180060378
    Abstract: A minimum value (MV) is computed for start timestamps that each correspond to an uncommitted transaction. In an embodiment, the MV is computed for a pluggable database that is open on at least first and second instances of a database. The MV is computed for the first instance as of a first current timestamp (CT). The MV and the first CT are communicated to a second instance that has a second CT. If the first and second CTs are equal, the second instance store the MV. If the first CT is bigger, the second CT also becomes equal to the first CT. If the first CT is smaller, the MV is discarded, and the first CT becomes equal to the second CT. In an embodiment, if the MV remains unchanged for a predetermined time period, a start timestamp corresponding to the MV is advanced to a current or future timestamp.
    Type: Application
    Filed: August 31, 2016
    Publication date: March 1, 2018
    Inventors: Kartik Kulkarni, Juan R. Loaiza, Vivekanandhan Raja, Kothanda Umamageswaran, Sanket Hase, Vasudha Krishnaswamy, Tirthankar Lahiri
  • Publication number: 20170116252
    Abstract: Techniques related to query execution against an in-memory standby database are disclosed. A first database includes PF data stored on persistent storage in a persistent format. The first database is accessible to a first database server that converts the PF data to a mirror format to produce MF data that is stored within volatile memory. The first database server receives, from a second database server, one or more change records indicating one or more transactions performed against a second database. The one or more change records are applied to the PF data, and a reference timestamp is advanced from a first to a second timestamp. The first database server invalidates any MF data that is changed by a subset of the one or more transactions that committed between the first and second timestamps.
    Type: Application
    Filed: August 31, 2016
    Publication date: April 27, 2017
    Inventors: Vasudha Krishnaswamy, Yunrui Li, Vivekanandhan Raja, Tirthankar Lahiri, Mahesh B. Girkar, Sukhada Pendse, Kartik Kulkarni, Jing Zheng, Shruti Gautam, Henry Chau
  • Patent number: 8832038
    Abstract: A method and apparatus for updating databases are disclosed. In response to a flashback request, a database object is restored to a state as of a specified flashback time. The changes introduced into the database object are reversed in a sequence starting with a change introduced into the database object immediately before issuance of the flashback request and ending with a change introduced into the database object immediately after the specified flashback time.
    Type: Grant
    Filed: March 2, 2009
    Date of Patent: September 9, 2014
    Assignee: Oracle International Corporation
    Inventors: Vasudha Krishnaswamy, Amit Ganesh
  • Patent number: 8589357
    Abstract: A technique for making versions of rows of a user-defined tracked table temporally queryable. The database management system of the technique permits temporal queries of user-defined tables. The queries return versions of rows in the user-defined table that are currently in an undo log maintained by the database system. Associated with the tracked table are a system history table which contains versions of the rows and temporal metadata indicating when the versions were in the tracked table and a system form history table which contains versions of the form of the tracked table and metadata indicating when the tracked table had the form. These tables are created and maintained by a background process in the database management system. A temporal query on the tracked table combines results from the undo log with results from the system history table. The results' form is determined by the system form history table.
    Type: Grant
    Filed: September 28, 2007
    Date of Patent: November 19, 2013
    Assignee: Oracle International Corporation
    Inventors: Venkatesh Radhakrishnan, Vasudha Krishnaswamy, Liang Guo, Bipul Sinha, Amit Ganesh
  • Patent number: 7885939
    Abstract: Methods and systems for automatically tuning the undo retention in a database system are disclosed. The undo tablespace may be of a fixed size or may be set to be automatically extended. If the undo tablespace is of a fixed size, the undo retention is set to a “best possible” undo retention, which is calculated based on statistical data stored in the system. If the undo tablespace is configured to be automatically extensible, the undo retention may be set to be greater than the duration of the longest running query in the system. The duration of the longest running query may be calculated in a distributed process in which each instance broadcasts information about its longest running query to other instances.
    Type: Grant
    Filed: October 11, 2005
    Date of Patent: February 8, 2011
    Assignee: Oracle International Corporation
    Inventors: Vasudha Krishnaswamy, Dheeraj Pandey, Bipul Sinha
  • Patent number: 7801932
    Abstract: Methods and systems for using undo hints to speed up segment extension are disclosed. While a process is searching other segments to find available space, the process collects undo hints that describe when space in a segment might become available. These undo hints are placed in a table of undo hints. When a process is not able to find available space, it may consult the table of undo hints to determine how much to decrease the undo retention. After the undo retention is decreased, the process may again consult the table of undo hints to find a segment that likely contains available space now that the undo retention time has been reduced.
    Type: Grant
    Filed: October 11, 2005
    Date of Patent: September 21, 2010
    Assignee: Oracle International Corporation
    Inventor: Vasudha Krishnaswamy
  • Patent number: 7644106
    Abstract: Techniques for avoiding lock contention when processing data definition language (DDL) statements are provided. Some DDL statements modify metadata of a table and then require access to the table. After such a DDL statement modifies the metadata of a table and the updated metadata is made available (i.e., published) to other database statements, execution of the DDL statement is suspended. Data manipulation language (DML) statements acquire locks on the table. In one approach, the locks, of any DML statement, that are granted after the DDL statement is issued are timestamped. The DDL statement uses the timestamps to determine when to access the table. The timestamps are used to determine when the last DML statement (that was pending at the time the modified metadata was published) commits and releases its lock on the table.
    Type: Grant
    Filed: July 30, 2007
    Date of Patent: January 5, 2010
    Assignee: Oracle International Corporation
    Inventors: Shrikanth Shankar, Ramesh Kumar, Amirali S. Valiani, Vasudha Krishnaswamy, Ananth Raghavan, Juan R. Loaiza
  • Patent number: 7574419
    Abstract: A method and apparatus for data recovery are disclosed. A plurality of queries executing in a database system are tracked. A query with a longest duration is selected and undo retention duration is calculated for supporting the longest query.
    Type: Grant
    Filed: May 13, 2004
    Date of Patent: August 11, 2009
    Assignee: Oracle International Corporation
    Inventors: Vasudha Krishnaswamy, Amit Ganesh
  • Publication number: 20090164525
    Abstract: A method and apparatus for updating databases are disclosed. In response to a flashback request, a database object is restored to a state as of a specified flashback time. The changes introduced into the database object are reversed in a sequence starting with a change introduced into the database object immediately before issuance of the flashback request and ending with a change introduced into the database object immediately after the specified flashback time.
    Type: Application
    Filed: March 2, 2009
    Publication date: June 25, 2009
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Vasudha Krishnaswamy, Amit Ganesh
  • Patent number: 7526508
    Abstract: An intelligent database infrastructure wherein the management of all database components is performed by and within the database itself by integrating management of various components with a central management control. Each individual database component, as well as the central management control, is self-managing. A central management control module integrates and interacts with the various database components. The database is configured to automatically tune to varying workloads and configurations, correct or alert about bad conditions, and advise on ways to improve overall system performance.
    Type: Grant
    Filed: September 3, 2004
    Date of Patent: April 28, 2009
    Assignee: Oracle International Corporation
    Inventors: Leng Leng Tan, Gianfranco Putzolu, Richard Sarwal, Alex Tsukerman, Gary C. Ngai, Graham Stephen Wood, Karl Dias, Mark Ramacher, Benoit Dageville, Mohamed Ziauddin, Tirthankar Lahiri, Sujatha Muthulingam, Vishwanath Karra, Francisco Sanchez, Hsiao-Te Su, Wanli Yang, Vasudha Krishnaswamy, Sushil Kumar
  • Patent number: 7499953
    Abstract: A method and apparatus for updating databases are disclosed. In response to a flashback request, a database object is restored to a state as of a specified flashback time. The changes introduced into the database object are reversed in a sequence starting with a change introduced into the database object immediately before issuance of the flashback request and ending with a change introduced into the database object immediately after the specified flashback time.
    Type: Grant
    Filed: April 23, 2004
    Date of Patent: March 3, 2009
    Assignee: Oracle International Corporation
    Inventors: Vasudha Krishnaswamy, Amit Ganesh