Fast identification of complex strings in a data stream

Details Fast identification of complex strings in a data stream Fast identification of complex strings in a data stream

2011-07-26

2011-07-26

Jalil, Neveen Abel (Department: 2165)

Data processing: database and file management or data structures

Database and file access

Record, file, and data search and comparisons

C707S755000, C707S756000

Reexamination Certificate

active

07987196

ABSTRACT:
A method for detecting and locating occurrence in a data stream of any complex string belonging to a predefined complex dictionary is disclosed. A complex string may comprise an arbitrary number of interleaving coherent strings and ambiguous strings. The method comprises a first process for transforming the complex dictionary into a simple structure to enable continuously conducting computationally efficient search, and a second process for examining received data in real time using the simple structure. The method may be implemented as an article of manufacture comprising at least one processor-readable medium and instructions carried on the at least one medium. The instructions causes a processor to match examined data to an object complex string belonging to the complex dictionary, where the matching process is based on equality to constituent coherent strings, and congruence to ambiguous strings, of the object complex string.

REFERENCES:
patent: 5388234 (1995-02-01), Kanno et al.
patent: 6278992 (2001-08-01), Curtis et al.
patent: 7254632 (2007-08-01), Zeira et al.
patent: 7325013 (2008-01-01), Caruso
patent: 7406470 (2008-07-01), Mathur et al.
patent: 7454418 (2008-11-01), Wang
patent: 7508985 (2009-03-01), Van Lunteren
patent: 7529746 (2009-05-01), Ichiriu et al.
patent: 2005/0120017 (2005-06-01), Motoki
patent: 2006/0020595 (2006-01-01), Norton et al.
patent: 2006/0235845 (2006-10-01), Argentar
patent: 2007/0127482 (2007-06-01), Harris et al.
patent: 2008/0071781 (2008-03-01), Ninan et al.
Xu Kefu, Qi Deyu, Qian Zhengping, Zheng Weiping Fast Dynamic Pattern Matching for Deep Packet Inspection 2007 IEEE.
Efficient String Matching: An Aid to Bibliographic Search, by A.V. Aho and M.J. Corasick, Communication of the ACM, Jun. 1975, v.18, No. 6, p. 333-340.
A New Approach to Text Searching, by R.A. Baeza-Yates and G.H. Connet, Communication of the ACM, 35, Oct. 1992, p. 74-82.
Regular Expression Search Algorithm, by Ken Thompaon, Communications of the ACM, Jun. 1968, v.11, No. 6, p. 419-422.
Gonzalo Navarro, Mathieu Raffinot Practical and flexible pattern matching over Ziv-Lempel compressed text Journal of Discrete Algorithms 2 (2004) 347-371 www.elsevier.com/locate/jda2 Feb. 2004.
Gonzalo Navarro, Takuya Kida, Masayuki Takeda, Ayumi Shinohara, Setsuo Arikawa Faster Approximate String Matching over Compressed Text IEEE 2001.

Affiliated with

Also associated with

Rating

Fast identification of complex strings in a data stream does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast identification of complex strings in a data stream, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast identification of complex strings in a data stream will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2632930