Integrated search engine devices and methods of updating same using node splitting and merging operations
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.
1. A method of updating a b-tree of search keys within a search engine, comprising the steps of:
inserting a first search key into the b-tree by reconfiguring a plurality of sibling nodes of the b-tree into an overloaded form having a shape that is independent of a value of the first search key inserted therein and then performing a split operation on the plurality of sibling nodes by redistributing the first and other search keys among an expanded plurality of the sibling nodes; and
deleting a second search key from the b-tree by reconfiguring the plurality of sibling nodes into a predetermined underloaded form having a shape that is independent of a value of the second search key omitted therefrom and then performing a merge operation on the plurality of sibling nodes by redistributing remaining search keys among a reduced plurality of the sibling nodes.
2. The method of claim 1 , wherein the b-tree is a b*tree of type N−(N+1), where N is a positive integer greater than one; and wherein the predetermined underloaded form includes a sibling node at a minimum fill level less one.
3. The method of claim 1 , wherein the overloaded form is a canonical form.
4. An integrated circuit search engine, comprising:
a hardware implemented b-tree of search keys; and
a maintenance engine electrically coupled to said hardware implemented b-tree of search keys, said maintenance engine configured to insert a first search key into the b-tree by reconfiguring a plurality of sibling nodes of the b-tree into an overloaded form having a shape that is independent of a value of the first search key inserted therein and then performing a split operation on the plurality of sibling nodes by redistributing the first and other search keys among an expanded plurality of the sibling nodes, wherein said maintenance engine is further configured to delete a second search key from the b-tree by reconfiguring the plurality of sibling nodes into a predetermined underloaded form having a shape that is independent of a value of the second search key omitted therefrom and then performing a merge operation on the plurality of sibling nodes by redistributing remaining search keys among a reduced plurality of the sibling nodes.
5. The integrated circuit search engine of claim 4 , wherein the overloaded form is a canonical form.