	US 7,482,955 B2
	String matching system and method using bloom filters to achieve sub-linear computation time
Po-Ching Lin, 4F., No.58, Alley 37, Lane 66, Dongyuan St., Wanhua District, Taipei City 108 (Taiwan); Ying-Dar Lin, No.1001, Dasyue Rd., East District, Hsinchu City 300 (Taiwan); Yi-Jun Zheng, No.1001, Dasyue Rd., East District, Hsinchu City 300 (Taiwan); and Yuan-Cheng Lai, No.43, Sec. 4, Keelung Rd., Da-an District, Taipei City 106 (Taiwan)
Filed on May 31, 2007, as Appl. No. 11/756,453.
Claims priority of application No. 95142250 A (TW), filed on Nov. 15, 2006.
Prior Publication US 2008/0111718 A1, May 15, 2008
Int. Cl. H03M 7/00 (2006.01)

U.S. Cl. 341—95 [341/50; 341/106; 341/107; 707/3; 707/5; 707/6]

11 Claims

1. A string matching system, comprising:

a text string;

a plurality of patterns;

an m-byte search window standing for an m-byte sub-string in the text string under inspection;

a plurality of Bloom filters, each of the Bloom filter comprising sub-strings of the plurality of patterns; wherein the Bloom filters are required for membership of a rightmost block in the m-byte search window to determine a shift length; and

a priority setting module, wherein when the Bloom filter generates two or more shift lengths, the priority setting module is used to determine the shift length and output the shorter shift length on a priority.