Patents by Inventor Manosiz Bhattacharyya
Manosiz Bhattacharyya 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: 10120764Abstract: Systems for storage system rollover and rollback. A data mover agent is installed on a source storage system to capture disaster recovery data and send to a target system. Upon receiving a rollover event signal, a virtualized controller creates one or more replica user virtual machines running on the target system that serve to replicate functions of the user virtual machines from the source storage system. The virtualized controller on the target system converts the target disaster recovery data from a first format to a second format to facilitate use of the target disaster recovery data by the replica user virtual machines. Rollback is initiated when the target system receives a rollback event signal. Differences in the data that have occurred between the rollover event and the rollback signal are calculated and sent to the rollback system. The calculated differences are applied to a registered snapshot on the rollback system.Type: GrantFiled: July 29, 2016Date of Patent: November 6, 2018Assignee: Nutanix, Inc.Inventors: Parthasarathy Ramachandran, Manosiz Bhattacharyya, Karthik Chandrasekaran
-
Patent number: 10061669Abstract: A method for providing real time replication status for a networked virtualization environment for storage management, includes scanning metadata to identify replication status for all virtual disks (vDisks) in the networked virtualization environment, generating replication tasks for vDisks that are identified as under replicated based on the scan, performing the replication tasks, monitoring the progress of the replication tasks and determining the real time replication status of the networked virtualization environment based on the scanned metadata and the monitored progress of the replication tasks.Type: GrantFiled: November 21, 2016Date of Patent: August 28, 2018Assignee: NUTANIX, INC.Inventors: Binny Sher Gill, Manosiz Bhattacharyya, Varun Kumar Arora
-
Patent number: 9965501Abstract: Techniques are provided for more efficiently using the bandwidth of the I/O path between a CPU and volatile memory during the performance of database operation. Relational data from a relational table is stored in volatile memory as column vectors, where each column vector contains values for a particular column of the table. A binary-comparable format may be used to represent each value within a column vector, regardless of the data type associated with the column. The column vectors may be compressed and/or encoded while in volatile memory, and decompressed/decoded on-the-fly within the CPU. Alternatively, the CPU may be designed to perform operations directly on the compressed and/or encoded column vector data. In addition, techniques are described that enable the CPU to perform vector processing operations on the column vector values.Type: GrantFiled: December 1, 2015Date of Patent: May 8, 2018Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Lawrence J. Ellison, Amit Ganesh, Vineet Marwah, Jesse Kamp, Anindya C. Patthak, Shasank K. Chavan, Michael J. Gleeson, Allison L. Holloway, Manosiz Bhattacharyya
-
Publication number: 20170322943Abstract: A method for maintaining a mapping structure for maintaining metadata for snapshots in a virtualized storage environment, includes taking a snapshot of a virtual disk, generating an entry in a metadata structure for the snapshot, wherein the entry includes metadata for blocks in the snapshot that have been modified since a preceding snapshot and lazily generating an entry in the mapping structure for the snapshot, wherein the entry includes values for each block in the snapshot, wherein a value for a block indicates a presence of metadata in the metadata structure for the block or an absence of metadata in the metadata structure for the block.Type: ApplicationFiled: July 26, 2017Publication date: November 9, 2017Applicant: Nutanix, Inc.Inventors: Manosiz BHATTACHARYYA, Vinayak Hindurao KHOT, Tabrez Parvez MEMON, Kannan MUTHUKKARUPPAN
-
Patent number: 9720921Abstract: A method for maintaining a mapping structure for maintaining metadata for snapshots in a virtualized storage environment, includes taking a snapshot of a virtual disk, generating an entry in a metadata structure for the snapshot, wherein the entry includes metadata for blocks in the snapshot that have been modified since a preceding snapshot and lazily generating an entry in the mapping structure for the snapshot, wherein the entry includes values for each block in the snapshot, wherein a value for a block indicates a presence of metadata in the metadata structure for the block or an absence of metadata in the metadata structure for the block.Type: GrantFiled: May 15, 2014Date of Patent: August 1, 2017Assignee: NUTANIX, INC.Inventors: Manosiz Bhattacharyya, Vinayak Hindurao Khot, Tabrez Parvez Memon, Kannan Muthukkaruppan
-
Publication number: 20170139793Abstract: A method for providing real time replication status for a networked virtualization environment for storage management, includes scanning metadata to identify replication status for all virtual disks (vDisks) in the networked virtualization environment, generating replication tasks for vDisks that are identified as under replicated based on the scan, performing the replication tasks, monitoring the progress of the replication tasks and determining the real time replication status of the networked virtualization environment based on the scanned metadata and the monitored progress of the replication tasks.Type: ApplicationFiled: November 21, 2016Publication date: May 18, 2017Applicant: NUTANIX, INC.Inventors: Binny Sher GILL, Manosiz BHATTACHARYYA, Varun Kumar ARORA
-
Patent number: 9559720Abstract: Techniques are described herein for automatically selecting the compression techniques to be used on tabular data. A compression analyzer gives users high-level control over the selection process without requiring the user to know details about the specific compression techniques that are available to the compression analyzer. Users are able to specify, for a given set of data, a “balance point” along the spectrum between “maximum performance” and “maximum compression”. The point thus selected is used by the compression analyzer in a variety of ways. For example, in one embodiment, the compression analyzer uses the user-specified balance point to determine which of the available compression techniques qualify as “candidate techniques” for the given set of data. The compression analyzer selects the compression technique to use on a set of data by actually testing the candidate compression techniques against samples from the set of data.Type: GrantFiled: September 28, 2012Date of Patent: January 31, 2017Assignee: Oracle International CorporationInventors: Vineet Marwah, Vikram Kapoor, Amit Ganesh, Jesse Kemp, Sachin Kulkarni, Roger Macnicol, Kam Shergill, Manosiz Bhattacharyya
-
Patent number: 9501379Abstract: A method for providing real time replication status for a networked virtualization environment for storage management, includes scanning metadata to identify replication status for all virtual disks (vDisks) in the networked virtualization environment, generating replication tasks for vDisks that are identified as under replicated based on the scan, performing the replication tasks, monitoring the progress of the replication tasks and determining the real time replication status of the networked virtualization environment based on the scanned metadata and the monitored progress of the replication tasks.Type: GrantFiled: April 11, 2014Date of Patent: November 22, 2016Assignee: Nutanix, Inc.Inventors: Binny Sher Gill, Manosiz Bhattacharyya, Varun Kumar Arora
-
Publication number: 20160203069Abstract: A method for providing real time replication status for a networked virtualization environment for storage management, includes scanning metadata to identify replication status for all virtual disks (vDisks) in the networked virtualization environment, generating replication tasks for vDisks that are identified as under replicated based on the scan, performing the replication tasks, monitoring the progress of the replication tasks and determining the real time replication status of the networked virtualization environment based on the scanned metadata and the monitored progress of the replication tasks.Type: ApplicationFiled: April 11, 2014Publication date: July 14, 2016Applicant: Nutanix, Inc.Inventors: Binny Sher GILL, Manosiz BHATTACHARYYA, Varun Kumar ARORA
-
Publication number: 20160085781Abstract: Techniques are provided for more efficiently using the bandwidth of the I/O path between a CPU and volatile memory during the performance of database operation. Relational data from a relational table is stored in volatile memory as column vectors, where each column vector contains values for a particular column of the table. A binary-comparable format may be used to represent each value within a column vector, regardless of the data type associated with the column. The column vectors may be compressed and/or encoded while in volatile memory, and decompressed/decoded on-the-fly within the CPU. Alternatively, the CPU may be designed to perform operations directly on the compressed and/or encoded column vector data. In addition, techniques are described that enable the CPU to perform vector processing operations on the column vector values.Type: ApplicationFiled: December 1, 2015Publication date: March 24, 2016Inventors: Lawrence J. Ellison, Amit Ganesh, Vineet Marwah, Jesse Kamp, Anindya C. Patthak, Shasank K. Chavan, Michael J. Gleeson, Allison L. Holloway, Manosiz Bhattacharyya
-
Patent number: 9201944Abstract: Techniques are provided for more efficiently using the bandwidth of the I/O path between a CPU and volatile memory during the performance of database operation. Relational data from a relational table is stored in volatile memory as column vectors, where each column vector contains values for a particular column of the table. A binary-comparable format may be used to represent each value within a column vector, regardless of the data type associated with the column. The column vectors may be compressed and/or encoded while in volatile memory, and decompressed/decoded on-the-fly within the CPU. Alternatively, the CPU may be designed to perform operations directly on the compressed and/or encoded column vector data. In addition, techniques are described that enable the CPU to perform vector processing operations on the column vector values.Type: GrantFiled: June 12, 2013Date of Patent: December 1, 2015Assignee: ORACLE INTERNATIONAL CORPORATIONInventors: Lawrence J. Ellison, Amit Ganesh, Vineet Marwah, Jesse Kamp, Anindya C. Patthak, Shasank K. Chavan, Michael J. Gleeson, Allison L. Holloway, Manosiz Bhattacharyya
-
Patent number: 8856083Abstract: A bulk delete operation with reduced latency allows for retrieval of deleted data. Each database object holds a Delete SCN indicating when a bulk delete operation was last performed. Each row in the database object holds a Row Modification SCN indicating when the row was last updated. A bulk delete is performed by writing the old value of the Delete SCN to the undo tablespace and updating the Delete SCN. No undo information is stored for the rows. A write is performed by finding a deleted row, storing undo information for the deleted row and writing over the deleted row. To read from the database object, a rollback operation is performed, if necessary. Those rows are then retrieved for which the Row Modification SCN is higher than the Delete SCN and is less than or equal to the timestamp for the requested data.Type: GrantFiled: June 9, 2006Date of Patent: October 7, 2014Assignee: Oracle International CorporationInventors: Amit Ganesh, Niloy Mukherjee, Manosiz Bhattacharyya, Bipul Sinha
-
Publication number: 20140074805Abstract: A database server stores compressed units in data blocks of a database. A table (or data from a plurality of rows thereof) is first compressed into a “compression unit” using any of a wide variety of compression techniques. The compression unit is then stored in one or more data block rows across one or more data blocks. As a result, a single data block row may comprise compressed data for a plurality of table rows, as encoded within the compression unit. Storage of compression units in data blocks maintains compatibility with existing data block-based databases, thus allowing the use of compression units in preexisting databases without modification to the underlying format of the database. The compression units may, for example, co-exist with uncompressed tables. Various techniques allow a database server to optimize access to data in the compression unit, so that the compression is virtually transparent to the user.Type: ApplicationFiled: November 13, 2013Publication date: March 13, 2014Applicant: Oracle International CorportionInventors: Vikram Kapoor, Amit Ganesh, Jesse Kamp, Sachin Kulkarni, Vineet Marwah, Kam Shergill, Roger Macnicol, Manosiz Bhattacharyya
-
Patent number: 8645337Abstract: A database server stores compressed units in data blocks of a database. A table (or data from a plurality of rows thereof) is first compressed into a “compression unit” using any of a wide variety of compression techniques. The compression unit is then stored in one or more data block rows across one or more data blocks. As a result, a single data block row may comprise compressed data for a plurality of table rows, as encoded within the compression unit. Storage of compression units in data blocks maintains compatibility with existing data block-based databases, thus allowing the use of compression units in preexisting databases without modification to the underlying format of the database. The compression units may, for example, co-exist with uncompressed tables. Various techniques allow a database server to optimize access to data in the compression unit, so that the compression is virtually transparent to the user.Type: GrantFiled: April 28, 2010Date of Patent: February 4, 2014Assignee: Oracle International CorporationInventors: Vikram Kapoor, Amit Ganesh, Jesse Kamp, Sachin Kulkarni, Vineet Marwah, Kam Shergill, Roger Macnicol, Manosiz Bhattacharyya
-
Patent number: 8572131Abstract: Techniques are provided for more efficiently using the bandwidth of the I/O path between a CPU and volatile memory during the performance of database operation. Relational data from a relational table is stored in volatile memory as column vectors, where each column vector contains values for a particular column of the table. A binary-comparable format may be used to represent each value within a column vector, regardless of the data type associated with the column. The column vectors may be compressed and/or encoded while in volatile memory, and decompressed/decoded on-the-fly within the CPU. Alternatively, the CPU may be designed to perform operations directly on the compressed and/or encoded column vector data. In addition, techniques are described that enable the CPU to perform vector processing operations on the column vector values.Type: GrantFiled: December 7, 2012Date of Patent: October 29, 2013Assignee: Oracle International CorporationInventors: Lawrence J. Ellison, Amit Ganesh, Vineet Marwah, Jesse Kamp, Anindya C. Patthak, Shasank K. Chavan, Michael J. Gleeson, Allison L. Holloway, Manosiz Bhattacharyya
-
Publication number: 20130275473Abstract: Techniques are provided for more efficiently using the bandwidth of the I/O path between a CPU and volatile memory during the performance of database operation. Relational data from a relational table is stored in volatile memory as column vectors, where each column vector contains values for a particular column of the table. A binary-comparable format may be used to represent each value within a column vector, regardless of the data type associated with the column. The column vectors may be compressed and/or encoded while in volatile memory, and decompressed/decoded on-the-fly within the CPU. Alternatively, the CPU may be designed to perform operations directly on the compressed and/or encoded column vector data. In addition, techniques are described that enable the CPU to perform vector processing operations on the column vector values.Type: ApplicationFiled: June 12, 2013Publication date: October 17, 2013Inventors: Lawrence J. Ellison, Amit Ganesh, Vineet Marwah, Jesse Kamp, Anindya C. Patthak, Shasank K. Chavan, Michael J. Gleeson, Allison L. Holloway, Manosiz Bhattacharyya
-
Patent number: 8521788Abstract: Techniques are provided for more efficiently using the bandwidth of the I/O path between a CPU and volatile memory during the performance of database operation. Relational data from a relational table is stored in volatile memory as column vectors, where each column vector contains values for a particular column of the table. A binary-comparable format may be used to represent each value within a column vector, regardless of the data type associated with the column. The column vectors may be compressed and/or encoded while in volatile memory, and decompressed/decoded on-the-fly within the CPU. Alternatively, the CPU may be designed to perform operations directly on the compressed and/or encoded column vector data. In addition, techniques are described that enable the CPU to perform vector processing operations on the column vector values.Type: GrantFiled: December 7, 2012Date of Patent: August 27, 2013Assignee: Oracle International CorporationInventors: Lawrence J. Ellison, Amit Ganesh, Vineet Marwah, Jesse Kamp, Anindya C. Patthak, Shasank K. Chavan, Michael J. Gleeson, Allison L. Holloway, Manosiz Bhattacharyya
-
Patent number: 8356060Abstract: Techniques are described herein for automatically selecting the compression techniques to be used on tabular data. A compression analyzer gives users high-level control over the selection process without requiring the user to know details about the specific compression techniques that are available to the compression analyzer. Users are able to specify, for a given set of data, a “balance point” along the spectrum between “maximum performance” and “maximum compression”. The point thus selected is used by the compression analyzer in a variety of ways. For example, in one embodiment, the compression analyzer uses the user-specified balance point to determine which of the available compression techniques qualify as “candidate techniques” for the given set of data. The compression analyzer selects the compression technique to use on a set of data by actually testing the candidate compression techniques against samples from the set of data.Type: GrantFiled: April 28, 2010Date of Patent: January 15, 2013Assignee: Oracle International CorporationInventors: Vineet Marwah, Vikram Kapoor, Amit Ganesh, Jesse Kamp, Sachin Kulkarni, Roger Macnicol, Kam Shergill, Manosiz Bhattacharyya
-
Patent number: 8239421Abstract: Described herein are compression and processing optimizations by using data transformation techniques. In example embodiments, a byte-wise differential transformation is applied to columnar data represented as a list of length-value pairs to determine a list of delta pairs that is subsequently compressed and stored on persistent storage. A length separation transformation is applied to separate a list of length-value pairs into a length array and a corresponding data value array, where these two arrays are subsequently compressed and stored separately on persistent storage. A native number transformation is applied to a set of number values to remove the lengths stored in the number values, where the transformed set is stored on persistent storage instead of the original set of number values.Type: GrantFiled: August 30, 2010Date of Patent: August 7, 2012Assignee: Oracle International CorporationInventors: Vineet Marwah, Vikram Kapoor, Jesse Kamp, Kam Shergill, Roger MacNicol, Manosiz Bhattacharyya, Amit Ganesh
-
Patent number: 8024737Abstract: Embodiments of the present invention that pertain to methods and systems for the calculation of resource requirements for a composite application are described. In one embodiment, information describing what component applications are associated with the composite application is received. Information describing metrics that are to be measured for the component applications is received. Information describing interrelationships between the component applications associated with the composite application is received. Information describing rules for calculating the resource requirements for the component applications is received. The rules are based on the interrelationships between the component applications and the metrics that are to be measured.Type: GrantFiled: April 24, 2006Date of Patent: September 20, 2011Assignee: Hewlett-Packard Development Company, L.P.Inventors: William H. Blanding, Manosiz Bhattacharyya, Jerry James Harrow, Jr., Glenna Mayo, David Isaiah Seidman