Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2006-09-19
2009-11-24
Mahmoudi, Tony (Department: 2169)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C365S049170
Reexamination Certificate
active
07624105
ABSTRACT:
A search engine configured to determine whether an input string including a plurality of input characters matches a regular expression including an inexact pattern including a specified range of instances of pattern characters each belonging to a specified set of characters, the search engine including a microcontroller having an input to receive a microprogram embodying the inexact pattern, a first co-processor coupled to the microcontroller and dedicated to determine whether each input character in a first portion of the input string is a member of the specified set of characters, and a second co-processor coupled to the microcontroller and dedicated to determine whether the number of input characters in the first portion of the input string falls within the specified range.
REFERENCES:
patent: 5051947 (1991-09-01), Messenger et al.
patent: 5299206 (1994-03-01), Beaverson et al.
patent: 5379420 (1995-01-01), Ullner
patent: 5712971 (1998-01-01), Stanfill et al.
patent: 6473846 (2002-10-01), Melchior
patent: 6473881 (2002-10-01), Lehner et al.
patent: 6760821 (2004-07-01), Stefan et al.
patent: 6785677 (2004-08-01), Fritchman
patent: 6856981 (2005-02-01), Wyschogrod et al.
patent: 6892237 (2005-05-01), Gai et al.
patent: 6952694 (2005-10-01), Mathur et al.
patent: 7082044 (2006-07-01), Gould et al.
patent: 7134143 (2006-11-01), Stellenberg et al.
patent: 7225188 (2007-05-01), Gai et al.
patent: 7254632 (2007-08-01), Zeira et al.
patent: 2003/0051043 (2003-03-01), Wyschogrod et al.
patent: 2003/0065800 (2003-04-01), Wyschogrod et al.
patent: 2003/0204493 (2003-10-01), Beylin
patent: 2003/0204584 (2003-10-01), Zeira et al.
patent: 2004/0143569 (2004-07-01), Gross et al.
patent: 2005/0108518 (2005-05-01), Pandya
patent: 2005/0114306 (2005-05-01), Shu et al.
patent: 2005/0132107 (2005-06-01), Cornet et al.
patent: 2005/0273450 (2005-12-01), McMillen et al.
patent: 2006/0085533 (2006-04-01), Hussain et al.
patent: 2007/0006293 (2007-01-01), Balakrishnan et al.
patent: 2007/0011734 (2007-01-01), Balakrishnan et al.
patent: 2007/0256037 (2007-11-01), Zavadsky et al.
patent: 2008/0071765 (2008-03-01), Ichiriu et al.
patent: 2008/0071779 (2008-03-01), Mammen et al.
patent: 2008/0071780 (2008-03-01), Ichiriu et al.
patent: 2008/0071781 (2008-03-01), Ninan et al.
Non-Final Office Action dated Oct. 2, 2008 for U.S. Appl. No. 11/523,958, 25 Pages.
IEEE Journal of Solid-State Circuits, vol. 23, No. 2: A Versatile Data String-Search VLSI, Masaki Hirata, Hachiro Yamada, Hajime Nagai, and Kousuke Takahashi, Apr. 1988.
Efficient String Matching: An Aid to Bibliographic Search; Programming Techniques; A. Aho and M. Corasick; Bell Laboratories; 1975, 8 pgs.
Fast Routing Table Lookup Using CAMs; McAuley et al.; Morristown, NJ, USA; 1993; 10 pgs.
Gigabit Rate Packet Pattern-Matching Using TCAM; Fang Yu, Randy Katcz EECS Dept. UC Berkeley, T.V. Lakshman, Bell Laboratories; date at least earlier than Jun. 3, 2008; 10 pgs.
High Speed Pattern Matching for Network IDS/IPS; Alicherry et al.; Lucent Bell Laboratories; IEEE, 2006, 10 pgs.
Small Forwarding Tables for Fast Routing Lookups; Degermark et al.; Lulea University of Technology; Lulea, Sweden; 1997; 12 pgs.
IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 12, No. 7: A Recursive MISD Architecture for Pattern Matching, Arne Halaas, Borge Svingen, Magnar Nedland, Pal Saetrom, Ola Snove, Jr. and Olaf Rene Birkeland, Jul. 2004, p. 727-734, 8 pages.
International Search Report and the Written Opinion of the International Searching Authority in International Application PCT/US2007/077404, European Patent Office, Jun. 4, 2008, 10 pages.
Bullen et al., “Microtext: the design of a microprogrammed finite state search machine for full-text retrieval,” In Proceedings of the Dec. 5-7, 1972, Fall Joint Computer Conference, Part I (Anaheim, California, Dec. 5-7, 1972). AFIPS '72 (Fall, part I). ACM, New York, NY, 479-488.
Intel Architecture Software Developer's Manual, vol. 2: Instruction Set Reference, Section 3:30 “BT-Bit Test”, Intel Corporation 1997.
Intel Itanium Architecture Software Developer's Manual, vol. 3: Instruction Set Reference, Revision 2.2, Section 3:238 “Ibit Test Bit”, Intel Corporation Jan. 2006.
Non-Final Office Action dated Feb. 2, 2009 for U.S. Appl. No. 11/523,881, 23 Pages.
Notice of Allowance dated Feb. 9, 2009 for U.S. Appl. No. 11/523,958, 9 Pages.
Fabry Martin
Ichiriu Michael E.
Ninan Ajit V.
Wall Larry A.
Mahamedi Paradice Kreisman LLP
Mahmoudi Tony
NetLogic Microsystems, Inc.
Paradice III William L.
Uddin Mohammed I.
LandOfFree
Search engine having multiple co-processors for performing... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Search engine having multiple co-processors for performing..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search engine having multiple co-processors for performing... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4069631