公开(公告)号：GB2371381B

公开(公告)日：2004-09-01

申请号：GB0108545

申请日：2001-04-05

Applicant: IBM

Inventor： BASS BRIAN M ,  CALVIGNAC JEAN L ,  HEDDES MARCO C ,  MARAGKOS ANTONIOS ,  SIEGEL MICHAEL S ,  VERPLANKEN FABRICE J ,  PATEL PIYUSH ,  JEFFRIES CLARK D ,  RINALDI MARK A

IPC: G06F17/30 ,  H04L12/701 ,  H04L12/741 ,  H04L12/743

Abstract: A method of performing a search based upon a search criterion using a tree is proposed. In use an input is read as a search key and the most significant bits are used as an index to a search table representing a plurality of search nodes. Each non empty entry in the search table will contain a pointer to the next branch of the tree. The search table may use a hash function to generate an index key. A determination is then made if the pointer points to a leaf or branch of the tree. If the pointer is to a branch the procedure is repeated until a leaf object is identified and returned to the calling application. In no entry is found that matches the search a no match is returned. The search criterion may be a longest prefix match in which instance the method is executed to find the position of the distinguishing bit.

公开(公告)号：GB2371381A

公开(公告)日：2002-07-24

申请号：GB0108545

申请日：2001-04-05

Applicant: IBM

Inventor： BASS BRIAN M ,  CALVIGNAC JEAN L ,  HEDDES MARCO C ,  MARAGKOS ANTONIOS ,  SIEGEL MICHAEL S ,  VERPLANKEN FABRICE J ,  PATEL PIYUSH ,  JEFFRIES CLARK D ,  RINALDI MARK A

IPC: G06F17/30 ,  H04L12/701 ,  H04L12/741 ,  H04L12/743

Abstract: A method of performing a search based upon a search criterion using a tree is proposed. In use an input is read as a search key and the most significant bits are used as an index to a search table representing a plurality of search nodes. Each non empty entry in the search table will contain a pointer to the next branch of the tree. The search table may use a hash function to generate an index key. A determination is then made if the pointer points to a leaf or branch of the tree. If the pointer is to a branch the procedure is repeated until a leaf object is identified and returned to the calling application. In no entry is found that matches the search a no match is returned. The search criterion may be a longest prefix match in which instance the method is executed to find the position of the distinguishing bit.