| http://www.w3.org/ns/prov#value | - Thus, it will be appreciated that the binary search tree essentially serves to associate the input value with an interval, with each interval being associated with a leaf node. [0084] In the context of the invention, the input value is an Internet address and the values associated with the leaf nodes comprise routing information. [0085] With this background, the binary search tree arrangement 90 w
|
