SET-ASSOCIATIVE HASH TABLE ORGANIZATION FOR EFFICIENT STORAGE AND RETRIEVAL OF DATA IN A STORAGE SYSTEM
    1.
    发明申请
    SET-ASSOCIATIVE HASH TABLE ORGANIZATION FOR EFFICIENT STORAGE AND RETRIEVAL OF DATA IN A STORAGE SYSTEM 审中-公开
    SET-ASSOCIATIVE HASH TABLE组织,用于存储系统中数据的有效存储和检索

    公开(公告)号:WO2015108667A1

    公开(公告)日:2015-07-23

    申请号:PCT/US2014/071446

    申请日:2014-12-19

    Applicant: NETAPP, INC.

    Abstract: The embodiments described herein are directed to the use of hashing in a file system metadata arrangement that reduces an amount of metadata stored in a memory of a node in a cluster and that reduces the amount of metadata needed to process an input/output (I/O) request at the node. Illustratively, the embodiments are directed to cuckoo hashing and, in particular, to a manner in which cuckoo hashing may be modified and applied to construct the file system metadata arrangement. In an embodiment, the file system metadata arrangement may be illustratively configured as a key-value extent store embodied as a data structure, e.g., a cuckoo hash table, wherein a value, such as a hash table index, may be configured as an index and applied to the cuckoo hash table to obtain a key, such as an extent key, configured to reference a location of an extent on one or more storage devices, such as solid state drives.

    Abstract translation: 这里描述的实施例涉及在文件系统元数据排列中使用散列的方式,其减少了存储在群集中的节点的存储器中的元数据量,并且减少了处理输入/输出所需的元数据量(I / O)请求。 示例性地,实施例针对杜鹃哈希,并且特别地涉及可以修改和应用杜鹃散列以构造文件系统元数据布置的方式。 在一个实施例中,文件系统元数据布置可以被示意性地配置为体现为数据结构的键值区段存储,例如布鲁克哈希表,其中诸如散列表索引的值可以被配置为索引 并且将其应用于布鲁克哈希表以获得诸如扩展密钥的密钥,其被配置为引用诸如固态驱动器之类的一个或多个存储设备上的盘区的位置。

    SET-ASSOCIATIVE HASH TABLE ORGANIZATION FOR EFFICIENT STORAGE AND RETRIEVAL OF DATA IN A STORAGE SYSTEM
    2.
    发明公开
    SET-ASSOCIATIVE HASH TABLE ORGANIZATION FOR EFFICIENT STORAGE AND RETRIEVAL OF DATA IN A STORAGE SYSTEM 有权
    数据集合和用于存储系统的联想HASHTABELLENORGANISATION高效存储和调查数据

    公开(公告)号:EP3095029A1

    公开(公告)日:2016-11-23

    申请号:EP14828399.7

    申请日:2014-12-19

    Applicant: NetApp, Inc.

    Abstract: In one embodiment, an extent key reconstruction technique is provided for use with a set of hash tables embodying metadata. The metadata includes an extent key associated with a storage location on storage devices for write data of one or more write requests organized into an extent. Each hash table has a plurality of entries, and each entry includes a plurality of slots. A first field of the extent key is recreated implicitly from an entry in a first address space portion of a hash table. A second field of the extent key is stored in the slot. A third field of the extent key is stored in the slot. A fourth field of the extent key is recreated implicitly from the hash table of the set of hash tables.

    Abstract translation: 在一个实施方式中,使用在文件系统元数据排列的散列减少对存储在集群中的一个节点的存储器中的元数据的量和减少了在节点处理到输入/输出(I / O)请求所需的元数据的量 , 说明性地,杜鹃散列可以被修改和应用来构造文件系统元数据的安排。 的文件系统元数据布置可以说明性地配置为体现为数据结构,例如,杜鹃哈希表,worin的值,检查作为哈希表索引键值程度商店,可以被配置为以索引和施加到 杜鹃哈希表来获得密钥,颜色:诸如程度键,配置为在一个或多个存储设备,颜色引用的程度的位置:例如固态驱动器。

Patent Agency Ranking