Patent ID: 8965911
Filing Date: 2015-02-24
Classification: G06F,H04L,Y10S

Abstract:
1. A method of searching a database using a search key, the database containing data stored in a tree data structure including a plurality of nodes that are associated with respective node keys, the method comprising: searching the tree data structure to attempt to identify a preferred prefix-matching node on the basis of attempting to find a node that has a longer prefix match with the search key than a prefix-matching node that has a prefix match with the search key, wherein at least some of the nodes are associated with at least one respective node rank; searching the tree structure to attempt to identify a preferred prefix-matching node on the basis of attempting to find a prefix-matching node that has a prefix match with the search key and which has a preferred node rank relative to a node rank associated with a node which may have a longer prefix match with the search key; determining that the prefix-matching node, if identified, has the preferred node rank based at least in part on using a dependent node rank identifier associated with the prefix matching node, the dependent node rank identifier indicating at least a node rank of a node which may have a longer prefix match with the search key than the prefix-matching node; and selecting the prefix-matching node which has the preferred node rank, if identified, as a preferred prefix-matching node, in preference to a node having a less-preferred node rank which may have a longer prefix match with the search key.