METHOD FOR GENERATING NODE OF MULTIPLE-SEARCH TREE AND FOR SEARCHING DATA OF MULTIPLE-SEARCH NODE TREE STRUCTURE

摘要

PURPOSE: A method for generating a node of a multiple-search tree and for searching the data of a multiple-search node tree structure is provided to receive associated information in one cache line by using one pointer recorded in a corresponding node regardless of the number of the keys used in one node. CONSTITUTION: In an 8-way search tree applied with a B tree, one node consists of 7 32 bit keys(K1-K7), a 16 bit node pointer(Po), and a 16 bit key pointer(Kp). The keys express the value of the keys. The node pointer expresses the position of the first node. The key pointer expresses the position of the first key. Po means the address of the first node among children nodes is 20000. The key pointer is a value indicating the pointer corresponding to the first key of a node. In a branch node, the key pointer indicates the information on the corresponding port number when the value is the same as the key value. Otherwise, the key pointer indicates the area information enabling a maximum effective matching method.