The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Oct. 10, 2006
Filed:
Aug. 28, 2003
Brian Mitchell Bass, Apex, NC (US);
Jean Louis Calvignac, Cary, NC (US);
Marco C. Heddes, Raleigh, NC (US);
Antonios Maragkos, Raleigh, NC (US);
Piyush Chunilal Patel, Cary, NC (US);
Michael Steven Siegel, Raleigh, NC (US);
Fabrice Jean Verplanken, La Gaude, FR;
Brian Mitchell Bass, Apex, NC (US);
Jean Louis Calvignac, Cary, NC (US);
Marco C. Heddes, Raleigh, NC (US);
Antonios Maragkos, Raleigh, NC (US);
Piyush Chunilal Patel, Cary, NC (US);
Michael Steven Siegel, Raleigh, NC (US);
Fabrice Jean Verplanken, La Gaude, FR;
International Business Machines Corporation, Armonk, NY (US);
Abstract
Novel data structures, methods and apparatus for finding a full match between a search pattern and a pattern stored in a leaf of the search tree. A key is input, a hash function is performed on the key, a direct table (DT) is accessed, and a tree is walked through pattern search control blocks (PSCBs) until reaching a leaf. The search mechanism uses a set of data structures that can be located in a few registers and regular memory, and then used to build a Patricia tree structure that can be manipulated by a relatively simple hardware macro. Both keys and corresponding information needed for retrieval are stored in the Patricia tree structure. The hash function provides an n->n mapping of the bits of the key to the bits of the hash key.