Patent ID: 7630996
Filing Date: 2009-12-08
Classification: H03M,H04L,Y10S

Abstract:
1. A computer-implemented method of compressing key entries within an associative search engine, the method comprising the steps of: (a) inputting a plurality of original key entries into a computer implemented memory within the associative search engine; (b) partitioning a particular original key entry of said original key entries, into at least two sections of bits, said at least two sections including both a first, common section and a second, differentiating section with respect to other said original key entries, each of said common section and said differentiating section having a predetermined length; (c) determining, by comparison of said particular original key entry with a monotonically-adjacent key entry, if a match exists in said common section, and (d) providing a particular compressed key entry for said particular original key entry, said compressed entry including compressed data corresponding to said particular original key entry, wherein if, in step (c), said match exists in said common section, said compressed data includes said differentiating section of said particular original key entry; (e) performing steps (b), (c), and (d) for each of said plurality of original key entries, and (f) arranging said compressed data to produce a monotonically ordered, compressed database associated with the associative search engine.