| 摘要 |
PROBLEM TO BE SOLVED: To speed up an operation for discovering an internal node when inserting data or searching for data while using an instruction for performing operation on data predetermined bit width.SOLUTION: The present invention is a technique for searching a tree using an instruction for performing operation on data in predetermined multiple bit widths, the technique including: classifying tree nodes into groups having a minimum bit width, among the plurality of bit widths, by which a key value is representable, and constructing the tree; and searching for data from a group in the minimum bit width in which the value of a search key is an effective number by using an instruction corresponding to the group in the minimum bit width in which the value of the search key is an effective number. |
