Patents by Inventor Deepak R. Attarde

Deepak R. Attarde 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: 9015181
    Abstract: Described in detail herein are systems and methods for managing single instancing data. Using a single instance database and other constructs (e.g. sparse files), data density on archival media (e.g. magnetic tape) is improved, and the number of files per storage operation is reduced. According to one aspect of a method for managing single instancing data, for each storage operation, a chunk folder is created on a storage device that stores single instancing data. The chunk folder contains three files: 1) a file that contains data objects that have been single instanced; 2) a file that contains data objects that have not been eligible for single instancing; and 3) a metadata file used to track the location of data objects within the other files. A second storage operation subsequent to a first storage operation contains references to data objects in the chunk folder created by the first storage operation instead of the data objects themselves.
    Type: Grant
    Filed: September 23, 2009
    Date of Patent: April 21, 2015
    Assignee: CommVault Systems, Inc.
    Inventors: Rajiv Kottomtharayil, Deepak R. Attarde, Manoj K. Vijayan
  • Patent number: 8578120
    Abstract: Described in detail herein are systems and methods for single instancing blocks of data in a data storage system. For example, the data storage system may include multiple computing devices (e.g., client computing devices) that store primary data. The data storage system may also include a secondary storage computing device, a single instance database, and one or more storage devices that store copies of the primary data (e.g., secondary copies, tertiary copies, etc.). The secondary storage computing device receives blocks of data from the computing devices and accesses the single instance database to determine whether the blocks of data are unique (meaning that no instances of the blocks of data are stored on the storage devices). If a block of data is unique, the single instance database stores it on a storage device. If not, the secondary storage computing device can avoid storing the block of data on the storage devices.
    Type: Grant
    Filed: December 28, 2009
    Date of Patent: November 5, 2013
    Assignee: CommVault Systems, Inc.
    Inventors: Deepak R. Attarde, Rajiv Kottomtharayil, Manoj K. Vijayan
  • Patent number: 8468538
    Abstract: A system and method for choosing a stream to transfer data is described. In some cases, the system reviews running data storage operations and chooses a data stream based on the review. In some cases, the system chooses a stream based on the load of data to be transferred.
    Type: Grant
    Filed: March 31, 2008
    Date of Patent: June 18, 2013
    Assignee: CommVault Systems, Inc.
    Inventors: Deepak R. Attarde, Parag Gokhale, Michael F. Klose
  • Patent number: 8401996
    Abstract: Described are systems and methods for storing a variable number of instances of data objects (e.g., 1, 2, 3, or up to N?1 instances, where N is the number of instances of the data object included in primary data) in secondary storage across a data storage network. In some examples, a system for storing a variable number of instances of data objects includes, one or more computing devices storing a set of data objects and multiple storage devices distinct from the one or more computing devices. Each of the multiple storage devices is configured to store at least a single instance of a data object. The system also includes a database configured to store information associated with the data objects. This information includes substantially unique identifiers for the data objects and, for each of the data objects, a number of instances of the data object stored on the multiple storage devices.
    Type: Grant
    Filed: December 30, 2009
    Date of Patent: March 19, 2013
    Assignee: CommVault Systems, Inc.
    Inventors: Marcus S. Muller, Deepak R. Attarde, Manoj Kumar Vijayan
  • Publication number: 20130006946
    Abstract: A method and system for reducing storage requirements and speeding up storage operations by reducing the storage of redundant data includes receiving a request that identifies one or more data objects to which to apply a storage operation. For each data object, the storage system determines if the data object contains data that matches another data object to which the storage operation was previously applied. If the data objects do not match, then the storage system performs the storage operation in a usual manner. However, if the data objects do match, then the storage system may avoid performing the storage operation.
    Type: Application
    Filed: September 14, 2012
    Publication date: January 3, 2013
    Applicant: CommVault Systems, Inc.
    Inventors: Anand Prahlad, Parag Gokhale, Rajiv Kottomtharayil, Manoj K. Vijayan Retnamma, Deepak R. Attarde
  • Patent number: 8285683
    Abstract: A method and system for reducing storage requirements and speeding up storage operations by reducing the storage of redundant data includes receiving a request that identifies one or more data objects to which to apply a storage operation. For each data object, the storage system determines if the data object contains data that matches another data object to which the storage operation was previously applied. If the data objects do not match, then the storage system performs the storage operation in a usual manner. However, if the data objects do match, then the storage system may avoid performing the storage operation.
    Type: Grant
    Filed: September 30, 2011
    Date of Patent: October 9, 2012
    Assignee: CommVault Systems, Inc.
    Inventors: Anand Prahlad, Parag Gokhale, Rajiv Kottomtharayil, Manoj K. Vijayan Retnamma, Deepak R. Attarde
  • Publication number: 20120023070
    Abstract: A method and system for reducing storage requirements and speeding up storage operations by reducing the storage of redundant data includes receiving a request that identifies one or more data objects to which to apply a storage operation. For each data object, the storage system determines if the data object contains data that matches another data object to which the storage operation was previously applied. If the data objects do not match, then the storage system performs the storage operation in a usual manner. However, if the data objects do match, then the storage system may avoid performing the storage operation.
    Type: Application
    Filed: September 30, 2011
    Publication date: January 26, 2012
    Inventors: Anand Prahlad, Parag Gokhale, Rajiv Kottomtharayil, Manoj K. Vijayan Retnamma, Deepak R. Attarde
  • Patent number: 8037028
    Abstract: A method and system for reducing storage requirements and speeding up storage operations by reducing the storage of redundant data includes receiving a request that identifies one or more data objects to which to apply a storage operation. For each data object, the storage system determines if the data object contains data that matches another data object to which the storage operation was previously applied. If the data objects do not match, then the storage system performs the storage operation in a usual manner. However, if the data objects do match, then the storage system may avoid performing the storage operation.
    Type: Grant
    Filed: March 28, 2008
    Date of Patent: October 11, 2011
    Assignee: CommVault Systems, Inc.
    Inventors: Anand Prahlad, Parag Gokhale, Rajiv Kottomtharayil, Manoj K. Vijayan Retnamma, Deepak R. Attarde
  • Patent number: 8037031
    Abstract: A method and system for creating an index of content without interfering with the source of the content includes an offline content indexing system that creates an index of content from an offline copy of data. The system may associate additional properties or tags with data that are not part of traditional indexing of content, such as the time the content was last available or user attributes associated with the content. Users can search the created index to locate content that is no longer available or based on the associate attributes.
    Type: Grant
    Filed: December 20, 2010
    Date of Patent: October 11, 2011
    Assignee: CommVault Systems, Inc.
    Inventors: Parag Gokhale, Rajiv Kottomtharayil, Deepak R. Attarde, Jun H. Ahn
  • Patent number: 7953706
    Abstract: A method and system for reducing storage requirements and speeding up storage operations by reducing the storage of redundant data includes receiving a request that identifies one or more data objects to which to apply a storage operation. For each data object, the storage system determines if the data object contains data that matches another data object to which the storage operation was previously applied. If the data objects do not match, then the storage system performs the storage operation in a usual manner. However, if the data objects do match, then the storage system may avoid performing the storage operation.
    Type: Grant
    Filed: March 28, 2008
    Date of Patent: May 31, 2011
    Assignee: CommVault Systems, Inc.
    Inventors: Anand Prahlad, Parag Gokhale, Rajiv Kottomtharayil, Manoj Kumar Vijayan Retnamma, Deepak R. Attarde
  • Publication number: 20110093470
    Abstract: A method and system for creating an index of content without interfering with the source of the content includes an offline content indexing system that creates an index of content from an offline copy of data. The system may associate additional properties or tags with data that are not part of traditional indexing of content, such as the time the content was last available or user attributes associated with the content. Users can search the created index to locate content that is no longer available or based on the associate attributes.
    Type: Application
    Filed: December 20, 2010
    Publication date: April 21, 2011
    Inventors: Parag Gokhale, Rajiv Kottomtharayil, Deepak R. Attarde, Jun H. Ahn
  • Patent number: 7882077
    Abstract: A method and system for creating an index of content without interfering with the source of the content includes an offline content indexing system that creates an index of content from an offline copy of data. The system may associate additional properties or tags with data that are not part of traditional indexing of content, such as the time the content was last available or user attributes associated with the content. Users can search the created index to locate content that is no longer available or based on the associate attributes.
    Type: Grant
    Filed: March 30, 2007
    Date of Patent: February 1, 2011
    Assignee: CommVault Systems, Inc.
    Inventors: Parag Gokhale, Rajiv Kottomtharayil, Deepak R. Attarde, Jun H. Ahn
  • Publication number: 20100299490
    Abstract: Described in detail herein are systems and methods for single instancing blocks of data in a data storage system. For example, the data storage system may include multiple computing devices (e.g., client computing devices) that store primary data. The data storage system may also include a secondary storage computing device, a single instance database, and one or more storage devices that store copies of the primary data (e.g., secondary copies, tertiary copies, etc.). The secondary storage computing device receives blocks of data from the computing devices and accesses the single instance database to determine whether the blocks of data are unique (meaning that no instances of the blocks of data are stored on the storage devices). If a block of data is unique, the single instance database stores it on a storage device. If not, the secondary storage computing device can avoid storing the block of data on the storage devices.
    Type: Application
    Filed: December 28, 2009
    Publication date: November 25, 2010
    Inventors: Deepak R. Attarde, Rajiv Kottomtharayil, Manoj K. Vijayan
  • Publication number: 20100250549
    Abstract: Described are systems and methods for storing a variable number of instances of data objects (e.g., 1, 2, 3, or up to N-1 instances, where N is the number of instances of the data object included in primary data) in secondary storage across a data storage network. In some examples, a system for storing a variable number of instances of data objects includes, one or more computing devices storing a set of data objects and multiple storage devices distinct from the one or more computing devices. Each of the multiple storage devices is configured to store at least a single instance of a data object. The system also includes a database configured to store information associated with the data objects. This information includes substantially unique identifiers for the data objects and, for each of the data objects, a number of instances of the data object stored on the multiple storage devices.
    Type: Application
    Filed: December 30, 2009
    Publication date: September 30, 2010
    Inventors: Marcus S. Muller, Deepak R. Attarde, Manoj Kumar Vijayan
  • Publication number: 20100082672
    Abstract: Described in detail herein are systems and methods for managing single instancing data. Using a single instance database and other constructs (e.g. sparse files), data density on archival media (e.g. magnetic tape) is improved, and the number of files per storage operation is reduced. According to one aspect of a method for managing single instancing data, for each storage operation, a chunk folder is created on a storage device that stores single instancing data. The chunk folder contains three files: 1) a file that contains data objects that have been single instanced; 2) a file that contains data objects that have not been eligible for single instancing; and 3) a metadata file used to track the location of data objects within the other files. A second storage operation subsequent to a first storage operation contains references to data objects in the chunk folder created by the first storage operation instead of the data objects themselves.
    Type: Application
    Filed: September 23, 2009
    Publication date: April 1, 2010
    Inventors: Rajiv Kottomtharayil, Deepak R. Attarde, Manoj K. Vijayan
  • Publication number: 20100070466
    Abstract: A stand-alone, network accessible data storage device, such as a filer or NAS device, is capable of transferring data objects based on portions of the data objects. The device transfers portions of files, folders, and other data objects from a data store within the device to external secondary storage based on certain criteria, such as time-based criteria, age-based criteria, and so on. A portion may be one or more blocks of a data object, or one or more chunks of a data object, or other segments that combine to form or store a data object. For example, the device identifies one or more blocks of a data object that satisfy a certain criteria, and migrates the identified blocks to external storage, thereby freeing up storage space within the device. The device may determine that a certain number of blocks of a file have not been modified or called by a file system in a certain time period, and migrate these blocks to secondary storage.
    Type: Application
    Filed: September 14, 2009
    Publication date: March 18, 2010
    Inventors: Anand Prahlad, Rajiv Kottomtharayil, Manoj K. Vijayan, Parag Gokhale, Deepak R. Attarde, Kamleshkumar K. Lad
  • Publication number: 20080288948
    Abstract: A system and method for choosing a stream to transfer data is described. In some cases, the system reviews running data storage operations and chooses a data stream based on the review. In some cases, the system chooses a stream based on the load of data to be transferred.
    Type: Application
    Filed: March 31, 2008
    Publication date: November 20, 2008
    Inventors: Deepak R. Attarde, Parag Gokhale, Michael F. Klose
  • Publication number: 20080243958
    Abstract: A method and system for reducing storage requirements and speeding up storage operations by reducing the storage of redundant data includes receiving a request that identifies one or more data objects to which to apply a storage operation. For each data object, the storage system determines if the data object contains data that matches another data object to which the storage operation was previously applied. If the data objects do not match, then the storage system performs the storage operation in a usual manner. However, if the data objects do match, then the storage system may avoid performing the storage operation.
    Type: Application
    Filed: March 28, 2008
    Publication date: October 2, 2008
    Inventors: Anand Prahlad, Parag Gokhale, Rajiv Kottomtharayil, Manoj K. Vijayan Retnamma, Deepak R. Attarde
  • Publication number: 20080243957
    Abstract: A method and system for reducing storage requirements and speeding up storage operations by reducing the storage of redundant data includes receiving a request that identifies one or more data objects to which to apply a storage operation. For each data object, the storage system determines if the data object contains data that matches another data object to which the storage operation was previously applied. If the data objects do not match, then the storage system performs the storage operation in a usual manner. However, if the data objects do match, then the storage system may avoid performing the storage operation.
    Type: Application
    Filed: March 28, 2008
    Publication date: October 2, 2008
    Inventors: Anand Prahlad, Parag Gokhale, Rajiv Kottomtharayil, Manoj Kumar Vijayan Retnamma, Deepak R. Attarde
  • Publication number: 20080243914
    Abstract: A method and system for reducing storage requirements and speeding up storage operations by reducing the storage of redundant data includes receiving a request that identifies one or more data objects to which to apply a storage operation. For each data object, the storage system determines if the data object contains data that matches another data object to which the storage operation was previously applied. If the data objects do not match, then the storage system performs the storage operation in a usual manner. However, if the data objects do match, then the storage system may avoid performing the storage operation.
    Type: Application
    Filed: March 28, 2008
    Publication date: October 2, 2008
    Inventors: Anand Prahlad, Parag Gokhale, Rajiv Kottomtharayil, Manoj K. Vijayan Retnamma, Deepak R. Attarde