The search process starts from the root node of UBBT. If [??] * v [greater than or equal to] 0, we execute iterative retrieval upon the left subtree, otherwise upon the right subtree until obtaining the leaf node.
In UBBT scheme, the leaf node is retrieved by the sign of the inner product [??] x v.