Method for searching tree using instruction of operating data having predetermined multiple bit widths
AssigneeInternational Business Machines Corporation
InventorKAZUAKI ISHIZAKI
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorKAZUAKI ISHIZAKI
Estimating the term…
Exemplary embodiments include methods and systems for searching a tree using an instruction of operating data having predetermined multiple bit widths. Aspects include constructing the tree by classifying nodes of the tree into groups having a minimum bit width capable of representing a value of a key among the multiple bit widths. Aspects further include searching for data in the group having the minimum bit width with a value of a search key being an effective number, using the instruction corresponding to the group having the minimum bit width with the value of the search key being the effective number.
A method of searching a tree using an instruction of operating data having predetermined multiple bit widths, the method, executed by a computer, comprising:
A computer for searching a tree using an instruction of operating data having predetermined multiple bit widths, comprising:
Dependencies are inferred from the claim text.