公开(公告)号：US20170316041A1

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

申请号：US15142828

申请日：2016-04-29

Applicant: NetApp, Inc.

Inventor： William P. Delaney ,  Joseph Blount ,  Charles Binford ,  Joseph Moore ,  Randolph Sterns ,  Jeff Stilger

IPC: G06F17/30

CPC classification number: G06F16/2246 ,  G06F16/2237 ,  G06F16/9017

Abstract: A method for mapping a first address space to a second address space is provided. In some embodiments, the method includes creating a first array of lookup entries and one or more second arrays of metadata entries for maintaining an ordering among the lookup entries using a tree structure. Each of the metadata entries includes one or more data index values identifying a corresponding one of the lookup entries by its position in the first array and one or more metadata index values identifying a corresponding one of the metadata entries by its position in one of the one or more second arrays. The method further includes receiving a request including a lookup value, traversing the tree structure to locate a lookup entry corresponding to the lookup value, and when the lookup value is located among the lookup entries, using the located lookup entry to process the request.

公开(公告)号：US20180324096A1

公开(公告)日：2018-11-08

申请号：US15590622

申请日：2017-05-09

Applicant: NetApp, Inc.

Inventor： Joseph Moore ,  William Delaney ,  Jeff Stilger

IPC: H04L12/743 ,  H04L9/08 ,  G06F17/30 ,  H04L29/06 ,  H04L12/753

CPC classification number: H04L45/7457 ,  G06F17/30625 ,  G06F2212/1052 ,  H04L9/0836 ,  H04L45/48 ,  H04L63/20

Abstract: A method, a computing device, and a non-transitory machine-readable medium for indexing data on a storage server are provided. A method includes providing, by a storage server, a plurality of sorted keys. A subset of the plurality of sorted keys that include a bit prefix is stored on a memory page. A trie representation is constructed that includes an entry corresponding to the memory page, wherein a position of the entry in the trie representation is determined based on a binary value of bits of the bit prefix. The trie representation is traversed, by the storage server, to access a record stored in the memory page, wherein the record corresponds to a key having the bit prefix.

公开(公告)号：US10366065B2

公开(公告)日：2019-07-30

申请号：US15142828

申请日：2016-04-29

Applicant: NetApp, Inc.

Inventor： William P. Delaney ,  Joseph Blount ,  Charles Binford ,  Joseph Moore ,  Randolph Sterns ,  Jeff Stilger

IPC: G06F17/30 ,  G06F16/22 ,  G06F16/901

Abstract: A method for mapping a first address space to a second address space is provided. In some embodiments, the method includes creating a first array of lookup entries and one or more second arrays of metadata entries for maintaining an ordering among the lookup entries using a tree structure. Each of the metadata entries includes one or more data index values identifying a corresponding one of the lookup entries by its position in the first array and one or more metadata index values identifying a corresponding one of the metadata entries by its position in one of the one or more second arrays. The method further includes receiving a request including a lookup value, traversing the tree structure to locate a lookup entry corresponding to the lookup value, and when the lookup value is located among the lookup entries, using the located lookup entry to process the request.

公开(公告)号：US10142234B1

公开(公告)日：2018-11-27

申请号：US15590622

申请日：2017-05-09

Applicant: NetApp, Inc.

Inventor： Joseph Moore ,  William Delaney ,  Jeff Stilger

IPC: G06F3/06 ,  G06F17/30 ,  H04L12/743 ,  H04L9/08 ,  H04L29/06 ,  H04L12/753

Abstract: A method, a computing device, and a non-transitory machine-readable medium for indexing data on a storage server are provided. A method includes providing, by a storage server, a plurality of sorted keys. A subset of the plurality of sorted keys that include a bit prefix is stored on a memory page. A trie representation is constructed that includes an entry corresponding to the memory page, wherein a position of the entry in the trie representation is determined based on a binary value of bits of the bit prefix. The trie representation is traversed, by the storage server, to access a record stored in the memory page, wherein the record corresponds to a key having the bit prefix.