中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

22 records (took 0.022 seconds)

    OVERWRITING PART OF COMPRESSED DATA WITHOUT DECOMPRESSING ON-DISK COMPRESSED DATA
    1.
    发明申请
    OVERWRITING PART OF COMPRESSED DATA WITHOUT DECOMPRESSING ON-DISK COMPRESSED DATA 有权
    压缩数据的一部分，不用去压缩磁盘压缩数据

    公开(公告)号：US20140258648A1

    公开(公告)日：2014-09-11

    申请号：US14286900

    申请日：2014-05-23

    Applicant: NetApp, Inc.

    Inventor： Sandeep Yadav ,  Rickard E. Faith ,  Subramaniam Periyagaram ,  Blake Lewis ,  Ashish Prakash

    IPC: G06F3/06

    CPC classification number: G06F3/064 ,  G06F3/061 ,  G06F3/0619 ,  G06F3/067 ,  G06F3/0689 ,  G06F17/30153 ,  G06F2211/1014 ,  G06F2212/401

    Abstract: Overwriting part of compressed data without decompressing on-disk compressed data is includes by receiving a write request for a block of data in a compression group from a client, wherein the compression group comprises a group of data blocks that is compressed, wherein the block of data is uncompressed. The storage server partially overwrites the compression group, wherein the compression group remains compressed while the partial overwriting is performed. The storage server determines whether the partially overwritten compression group including the uncompressed block of data should be compressed. The storage server defers compression of the partially overwritten compression group if the partially overwritten compression group should not be compressed. The storage server compresses the partially overwritten compression group if the partially overwritten compression group should be compressed.

    Abstract translation: 在不解压缩磁盘压缩数据的情况下覆盖压缩数据的一部分包括通过从客户端接收对压缩组中的数据块的写请求，其中压缩组包括被压缩的一组数据块，其中， 数据未压缩。 存储服务器部分地覆盖压缩组，其中在执行部分重写的同时，压缩组保持压缩。 存储服务器确定是否应压缩包括未压缩数据块的部分覆盖压缩组。 如果部分覆盖的压缩组不应被压缩，则存储服务器会延迟部分覆盖压缩组的压缩。 如果部分覆盖的压缩组应该被压缩，存储服务器会压缩部分覆盖的压缩组。

    SYSTEMS, METHODS AND DEVICES FOR ADDRESSING DATA BLOCKS IN MASS STORAGE FILING SYSTEMS
    3.
    发明申请
    SYSTEMS, METHODS AND DEVICES FOR ADDRESSING DATA BLOCKS IN MASS STORAGE FILING SYSTEMS 有权
    用于在大容量存储系统中寻址数据块的系统，方法和设备

    公开(公告)号：US20170031614A1

    公开(公告)日：2017-02-02

    申请号：US14815601

    申请日：2015-07-31

    Applicant: NetApp, Inc.

    Inventor： Manish Katiyar ,  Anathan Subramanian ,  Subramaniam Periyagaram

    IPC: G06F3/06

    CPC classification number: G06F3/0643 ,  G06F3/0604 ,  G06F3/0665 ,  G06F3/067

    Abstract: Presented herein are mass data storage networks, file system protocols, non-transitory machine readable devices, and methods for storing data blocks in mass data storage systems. Methods for storing data blocks in a file system are disclosed which include: receiving by storage controller of the data storage system a request to write a data file to a system storage module; determining whether the data file includes a sub-K data chunk that is less than approximately four kilobytes; identifying a packed block that stores a plurality of sub-K data chunks and has sufficient storage space available to store the sub-K data chunk; and placing, by the storage controller in the packed block, the sub-K data chunk and a corresponding data length and a respective offset identifying a location of the sub-K data chunk in the packed block.

    Abstract translation: 这里提出的是大容量数据存储网络，文件系统协议，非暂时机器可读设备以及用于在大容量数据存储系统中存储数据块的方法。 公开了一种在文件系统中存储数据块的方法，包括：存储控制器向数据存储系统接收将数据文件写入系统存储模块的请求; 确定数据文件是否包括小于约四千字节的子K数据块; 识别存储多个子K数据块的打包块，并且具有可用于存储子K数据块的足够的存储空间; 以及由所述打包块中的存储控制器将所述子K数据块和对应的数据长度以及相应的偏移量标识在所述打包块中的所述子K数据块的位置。

    Systems, methods and devices for addressing data blocks in mass storage filing systems
    5.
    发明授权
    Systems, methods and devices for addressing data blocks in mass storage filing systems 有权

    公开(公告)号：US09952797B2

    公开(公告)日：2018-04-24

    申请号：US14815601

    申请日：2015-07-31

    Applicant: NetApp, Inc.

    Inventor： Manish Katiyar ,  Anathan Subramanian ,  Subramaniam Periyagaram

    IPC: G06F3/06

    CPC classification number: G06F3/0643 ,  G06F3/0604 ,  G06F3/0665 ,  G06F3/067

    Abstract: Presented herein are mass data storage networks, file system protocols, non-transitory machine readable devices, and methods for storing data blocks in mass data storage systems. Methods for storing data blocks in a file system are disclosed which include: receiving by storage controller of the data storage system a request to write a data file to a system storage module; determining whether the data file includes a sub-K data chunk that is less than approximately four kilobytes; identifying a packed block that stores a plurality of sub-K data chunks and has sufficient storage space available to store the sub-K data chunk; and placing, by the storage controller in the packed block, the sub-K data chunk and a corresponding data length and a respective offset identifying a location of the sub-K data chunk in the packed block.

    Systems, methods, and computer program products implementing hybrid file structures for data storage
    6.
    发明授权
    Systems, methods, and computer program products implementing hybrid file structures for data storage 有权
    实现用于数据存储的混合文件结构的系统，方法和计算机程序产品

    公开(公告)号：US09557937B2

    公开(公告)日：2017-01-31

    申请号：US13972620

    申请日：2013-08-21

    Applicant: NETAPP, INC.

    Inventor： Mohit Gupta ,  Subramaniam Periyagaram ,  Vania N. Fang ,  Robert English ,  Ram Kesavan

    IPC: G06F12/00 ,  G06F3/06

    CPC classification number: G06F3/0685 ,  G06F3/061 ,  G06F3/0619 ,  G06F3/0643 ,  G06F3/065 ,  G06F3/067

    Abstract: Systems, methods, and computer program products implementing hybrid file structures for data storage are provided. One embodiment of a method performed in a computer-based storage system includes writing a file as data blocks in an array of storage devices. The method includes associating the data blocks with metadata related to at least one location in the array of storage devices for later access to the data blocks. The file is represented as a hierarchical data structure having a plurality of nodes. A first portion of nodes has a first span type, and a second portion of nodes has a second span type. The data structure includes a buftree. The first span type includes a fixed-span type. The second span type includes a variable-span type.

    Abstract translation: 提供了实现用于数据存储的混合文件结构的系统，方法和计算机程序产品。 在基于计算机的存储系统中执行的方法的一个实施例包括将文件作为数据块写入存储设备的阵列中。 该方法包括将数据块与存储设备阵列中的至少一个位置相关的元数据相关联，以便稍后访问数据块。 该文件被表示为具有多个节点的分层数据结构。 节点的第一部分具有第一跨度类型，节点的第二部分具有第二跨度类型。 数据结构包括一个buftree。 第一种跨度类型包括固定跨度类型。 第二种跨度类型包括可变跨度类型。

    SYSTEMS AND METHODS FOR INSTANTANEOUS CLONING
    7.
    发明申请
    SYSTEMS AND METHODS FOR INSTANTANEOUS CLONING 有权
    用于瞬时克隆的系统和方法

    公开(公告)号：US20140331011A1

    公开(公告)日：2014-11-06

    申请号：US14334349

    申请日：2014-07-17

    Applicant: NetApp. Inc.

    Inventor： Ram Kesavan ,  Sriram Venketaraman ,  Mohit Gupta ,  Subramaniam Periyagaram

    IPC: G06F3/06

    CPC classification number: G06F3/065 ,  G06F3/0617 ,  G06F3/0619 ,  G06F3/0641 ,  G06F3/067 ,  G06F3/0689 ,  G06F17/30091 ,  G06F17/30115 ,  G06F17/30129 ,  G06F17/30203

    Abstract: Techniques to clone a writeable data object in non-persistent memory are disclosed. The writeable data object is stored in a storage structure in non-persistent memory that corresponds to a portion of a persistent storage. The techniques enable cloning of the writeable data object without having to wait until the writeable data object is saved to the persistent storage and without needing to quiesce incoming operations (e.g., reads and writes) to the writeable data object.

    Abstract translation: 公开了在非持久存储器中克隆可写数据对象的技术。 可写数据对象被存储在对应于持久存储器的一部分的非永久存储器中的存储结构中。 该技术能够克隆可写数据对象，而不必等到可写数据对象被保存到永久存储器中，而不需要暂停对可写数据对象的传入操作（例如，读和写）。

    Systems and methods for instantaneous cloning
    8.
    发明授权
    Systems and methods for instantaneous cloning 有权
    瞬时克隆的系统和方法

    公开(公告)号：US08812450B1

    公开(公告)日：2014-08-19

    申请号：US13781462

    申请日：2013-02-28

    Applicant: NetApp, Inc.

    Inventor： Ram Kesavan ,  Sriram Venketaraman ,  Mohit Gupta ,  Subramaniam Periyagaram

    IPC: G06F17/30 ,  G06F3/06

    CPC classification number: G06F3/065 ,  G06F3/0617 ,  G06F3/0619 ,  G06F3/0641 ,  G06F3/067 ,  G06F3/0689 ,  G06F17/30091 ,  G06F17/30115 ,  G06F17/30129 ,  G06F17/30203

    Abstract: Techniques to clone a writeable data object in non-persistent memory are disclosed. The writeable data object is stored in a storage structure in non-persistent memory that corresponds to a portion of a persistent storage. The techniques enable cloning of the writeable data object without having to wait until the writeable data object is saved to the persistent storage and without needing to quiesce incoming operations (e.g., reads and writes) to the writeable data object.

    Abstract translation: 公开了在非持久存储器中克隆可写数据对象的技术。 可写数据对象被存储在对应于持久存储器的一部分的非永久存储器中的存储结构中。 该技术能够克隆可写数据对象，而不必等到可写数据对象被保存到永久存储器中，而不需要暂停对可写数据对象的传入操作（例如，读和写）。

    DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE
    9.
    发明申请
    DEDUPLICATION IN AN EXTENT-BASED ARCHITECTURE 有权
    在基于结构的架构中的分类

    公开(公告)号：US20140201168A1

    公开(公告)日：2014-07-17

    申请号：US14087345

    申请日：2013-11-22

    Applicant: NetApp, Inc.

    Inventor： Subramaniam Periyagaram ,  Sandeep Yadav ,  Blake Lewis ,  Rickard E. Faith ,  Ashish Prakash ,  Ram Kesavan ,  Ananthan Subramanian

    IPC: G06F17/30

    CPC classification number: G06F17/30156 ,  G06F3/0608 ,  G06F3/0641

    Abstract: A request is received to remove duplicate data. A log data container associated with a storage volume in a storage server is accessed. The log data container includes a plurality of entries. Each entry is identified by an extent identifier in a data structures stored in a volume associated with the storage server. For each entry in the log data container, a determination is made if the entry matches another entry in the log data container. If the entry matches another entry in the log data container, a determination is made of a donor extent and a recipient extent. If an external reference count associated with the recipient extent equals a first predetermined value, block sharing is performed for the donor extent and the recipient extent. A determination is made if the reference count of the donor extent equals a second predetermined value. If the reference count of the donor extent equals the second predetermined value, the donor extent is freed.

    Abstract translation: 收到请求以删除重复的数据。 访问与存储服务器中的存储卷相关联的日志数据容器。 日志数据容器包括多个条目。 每个条目由存储在与存储服务器相关联的卷中的数据结构中的盘区标识符标识。 对于日志数据容器中的每个条目，确定条目是否匹配日志数据容器中的另一个条目。 如果条目与日志数据容器中的另一个条目匹配，则确定捐赠者范围和受众范围。 如果与接收者范围相关联的外部参考计数等于第一预定值，则对捐赠者范围和接受者范围执行块共享。 如果供体范围的参考计数等于第二预定值，则确定。 如果供体范围的参考计数等于第二预定值，则供体范围被释放。

Patent Agency Ranking