公开(公告)号：US07716204B1

公开(公告)日：2010-05-11

申请号：US11962716

申请日：2007-12-21

Applicant: Gary Depelteau ,  Pascal de Wit

Inventor： Gary Depelteau ,  Pascal de Wit

IPC: G06F7/00 ,  G06F13/00 ,  G06F13/28 ,  G06F15/16 ,  G06F17/30 ,  H04L12/28 ,  H04L12/56

CPC classification number: H04L45/7457 ,  G06F17/30955

Abstract: A handle allocation manager is provided for an integrated circuit search engine device that includes multiple stages of a multilevel tree of search keys and a handle memory. The handle allocation manager includes a handle availability memory that stores handle availability indicators to provide an indication of whether a handle is available for association with a key. A handle availability summary memory stores indicators for groups of handles and a block availability summary memory stores indicators for multiple groups of handle availability summary memories. The handle allocation manager can use these memories to search for a next available handle. Related methods are also provided.

Abstract translation: 提供了一种用于集成电路搜索引擎设备的句柄分配管理器，其包括多级搜索键的多级树和句柄存储器。 句柄分配管理器包括句柄可用性存储器，其存储句柄可用性指示符以提供句柄是否可用于与键相关联的指示。 句柄可用性摘要存储器存储用于组句柄的指示符，并且块可用性总结存储器存储用于多组句柄可用性总结存储器的指示符。 句柄分配管理器可以使用这些存储器来搜索下一个可用句柄。 还提供了相关方法。

公开(公告)号：US07801877B1

公开(公告)日：2010-09-21

申请号：US12102282

申请日：2008-04-14

Applicant: Gary Depelteau ,  Pascal de Wit

Inventor： Gary Depelteau ,  Pascal de Wit

IPC: G06F7/00

CPC classification number: G06F17/30982

Abstract: Integrated circuit search engine devices include serially connected stages, a handle memory and a handle memory access manager. The stages store search keys in a multilevel tree of search keys. A first level stage is responsive to an input search key and a last level stage identifies a best match key for the input search key. The handle memory includes handle memory locations that store search result handles. The handle memory access manager searches the handle memory to retrieve a search result handle that corresponds to a best match key. The handle memory access manager refrains from modifying the handle memory in response to modify instructions during active periods of the handle memory when the handle memory is being searched. The handle memory access manager modifies the handle memory in response to the modify instructions during idle periods of the handle memory when the handle memory is not being searched. Related methods are also disclosed.

Abstract translation: 集成电路搜索引擎设备包括串行连接的级，句柄存储器和句柄存储器访问管理器。 阶段将搜索键存储在多级搜索键树中。 第一级响应于输入搜索关键字，最后一级标识输入搜索关键字的最佳匹配键。 句柄存储器包括存储搜索结果句柄的句柄存储器位置。 句柄存储器访问管理器搜索句柄存储器以检索对应于最佳匹配键的搜索结果句柄。 当正在搜索句柄存储器时，句柄存储器访问管理器避免修改句柄存储器以响应于句柄存储器的活动期间的修改指令。 当句柄存储器未被搜索时，句柄存储器访问管理器响应于句柄存储器的空闲周期期间的修改指令来修改句柄存储器。 还公开了相关方法。

公开(公告)号：US07697518B1

公开(公告)日：2010-04-13

申请号：US11532225

申请日：2006-09-15

Applicant: Pascal de Wit

Inventor： Pascal de Wit

IPC: H04L12/28 ,  H04L12/56

CPC classification number: G06F17/30961 ,  G06F17/30985

Abstract: Methods of updating b-tree data structures (e.g., b*tree data structure) using search key insertion and deletion operations proceed from respective known states (e.g., respective canonical forms). These insertion operations include inserting a first search key into the b-tree by reconfiguring (e.g., pre-processing) a plurality of sibling nodes of the b-tree into a predetermined overloaded form having a shape that is independent of a value of the first search key to be inserted therein. An operation is then performed to split the sibling nodes by redistributing the first and other search keys among an expanded plurality of the sibling nodes. These insertion operations use a process that trades off possibly performing additional memory accesses (e.g., to shift search keys (and/or handles or pointers) to the predetermined overloaded form) for the certainty that the same key movements are ultimately performed during operations to split sibling nodes.

Abstract translation: 使用搜索关键字插入和删除操作来更新b-tree数据结构（例如，b *树数据结构）的方法从相应的已知状态（例如，相应的规范形式）进行。 这些插入操作包括通过将b-树的多个兄弟节点重新配置（例如，预处理）成预定的重载形式，将第一搜索密钥插入到b树中，该预定重载形式具有独立于第一 搜索键插入其中。 然后执行操作以通过在扩展的多个兄弟节点中重新分配第一和其他搜索关键来拆分兄弟节点。 这些插入操作使用可能执行附加存储器访问的过程（例如，将搜索键（和/或句柄或指针）移位到预定的重载形式），以确定在分割操作期间最终执行相同的键移动 兄弟节点。