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 有权
    集合关联哈希表组织,用于存储系统中的数据的高效存储和检索

    公开(公告)号:US08874842B1

    公开(公告)日:2014-10-28

    申请号:US14160133

    申请日:2014-01-21

    Applicant: NetApp, Inc.

    Abstract: In one embodiment, use of hashing in a file system metadata arrangement reduces an amount of metadata stored in a memory of a node in a cluster and reduces the amount of metadata needed to process an input/output (I/O) request at the node. Illustratively, cuckoo hashing may be modified and applied to construct the file system metadata arrangement. 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)请求所需的元数据量 。 说明性地,可以修改并应用杜鹃散列来构建文件系统元数据排列。 文件系统元数据布置可以被示意性地配置为体现为数据结构的键值区段存储,例如布鲁克哈希表,其中诸如哈希表索引的值可以被配置为索引并应用于 布鲁克哈希表以获得诸如扩展密钥的密钥,其被配置为引用一个或多个存储设备(例如固态驱动器)上的盘区的位置。

Patent Agency Ranking