WO2004021170A2 - Programmable rule processing apparatus for conducting high speed contextual searches & characterzations of patterns in data - Google Patents
Programmable rule processing apparatus for conducting high speed contextual searches & characterzations of patterns in data Download PDFInfo
- Publication number
- WO2004021170A2 WO2004021170A2 PCT/US2003/027518 US0327518W WO2004021170A2 WO 2004021170 A2 WO2004021170 A2 WO 2004021170A2 US 0327518 W US0327518 W US 0327518W WO 2004021170 A2 WO2004021170 A2 WO 2004021170A2
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- search
- rale
- pattern
- array
- processor defined
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/903—Querying
- G06F16/90335—Query processing
- G06F16/90344—Query processing by using string matching techniques
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10—TECHNICAL SUBJECTS COVERED BY FORMER USPC
- Y10S—TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y10S707/00—Data processing: database and file management or data structures
- Y10S707/99931—Database or file accessing
- Y10S707/99933—Query processing, i.e. searching
- Y10S707/99936—Pattern matching access
Definitions
- the present invention relates to the field of information processing, specifically the field of content analytics and processing.
- Intrusion detection systems need to be able to detect all known attacks on the system, and also be intelligent enough to detect unusual and suspicious behavior that is indicative of new attacks. All these factors lead to a requirement for both programmability as well as extremely high performance on content analysis and processing.
- search and lookup processing has typically has been performed in one of two ways.
- ASIC application specific integrated circuits
- CAMs content addressable memories
- comparator hardware For example, search rules are stored in a content-addressable memory, and the data is streamed across the structure, shifting it 1 byte or 1 word at a time.
- specific comparators are arranged at fixed locations to recognize specific values in the incoming data. Incidences of matches are recorded and consumed by the dedicated logic as per the requirements of the target application.
- the microprocessor architecture has two key limitations - (1) it lacks the capability to simultaneously perform massively parallel and fine-grain pattern-matching and comparison operations on large datasets, and (2) it lacks the capability to make rapid and multiple state transitions and efficient multidirectional control flow changes based on input data.
- the instruction set of the microprocessor is a scalar instruction set, such that instructions need to be executed in a single ordered sequence.
- the instruction sets of typical microprocessors enable the comparison of a single 64-bit quantity stored in a register with another 64-bit quantity stored in a different register. The comparison is performed with the two operands aligned. If the comparison is being performed for the purpose of a pattern search, then it needs to be invoked repeatedly after shifting one or both of the operands by a variable number of bytes each time. Often, such repeated shifting is performed in a loop with a control flow change that transfers control from the code at the bottom of the loop to the code at the top of the loop on each iteration.
- Control flow changes in the microprocessor are accomplished by branching to a fresh sequence of code. Since modern microprocessors are highly pipelined (of the order of 20-30 stages in products like the Pentium m and Pentium IN processors from Intel Corporation of Santa Clara, California), the performance penalty incurred due to branching is significant. The entire microprocessor pipeline needs to be flushed on a taken branch. Sophisticated branch prediction techniques hence need to be applied on such processors to keep the pipeline sufficiently fed with instructions from the desired path in the wake of control flow changes. However, most branch prediction techniques provide only empirical and statistical performance improvements, such that control flow changes for the most part introduce a slowdown as well as non-determinism in the performance level that can be delivered.
- the Boyer-Moore algorithm is widely regarded as one of the best-known techniques employed on a microprocessor to find occurrences of patterns in a given data set.
- the algorithm processes only one pattern at a time and must be repeatedly invoked if more than one pattern is to be searched in a data set. For each pattern to be searched, it advances sequentially through the data set making selective comparisons based on observations obtained from pre- characterizing the pattern. This algorithm provides superior performance relative to other pattern matching algorithms by reducing the total number of comparisons within a given data set.
- the processor comprises multiple input payload search registers and search execution hardware coupled to the search registers to perform one or more contextual searches on content in the search registers via parallel pattern matching in response to executing one or more instructions specifying the one or more pattern searches and presenting one or more patterns to the content in the search registers.
- Figure 1 is a block diagram of one embodiment of a rule processor with a search apparatus.
- Figure 2A is a block diagram of one embodiment of a search register and the search execution hardware.
- Figure 2B is a block diagram of one embodiment of a search array.
- Figure 3A is a block diagram of one embodiment of a sorter.
- Figure 3B is a block diagram of one embodiment of a range select mechanism in a sorter.
- Figure 4 is a circuit schematic of one embodiment of a search array.
- Figure 5 illustrates an exemplary micro-architecture of a rule processor comprising of four processing stages.
- Figure 6 illustrates an example pseudo-code of a complex pattern matching rule-set and the corresponding micro-code for an exemplary rule- processor.
- Figure 7 illustrates the clock-by-clock pipelined execution of the micro-code shown in Figure 6.
- a programmable rule processing apparatus for conducting high-speed contextual searches of arbitrarily long patterns in a document, message, or other content is described.
- the rule processor provides an architecture that is tailored for content search and analysis.
- the rule processor allows for rapid parallel and recursive sequencing of rules against a content payload, thereby enabling efficient processing of workloads intensive in rale-grammars.
- the rule processor employs a set of input payload search registers.
- a search register file holds the input data (or content payload) that is to be presented to various search rules.
- Search execution hardware is coupled to the search registers. This hardware performs the pattern matching and processing functionality needed to compute the results of the search function.
- Figure 1 is a block diagram of one embodiment of a rule processor comprising search registers 101 and search execution hardware 102.
- Search instruction 103 is presented to search registers 101 and search execution hardwarel02.
- the processor further comprises of an instruction store referred to as rule/instruction memory 104 and an apparatus to control the flow of instructions that includes, in one embodiment, instruction sequencer 105 and instruction pointer 106.
- search registers 101 comprise a register file with
- a typical search entails presentation of an instruction or rule to the search registers.
- the rule specifies a pattern along with one or more additional search parameters.
- the search function returns a number of results. These include an indication of whether or not a match was found between the pattern and the content in the search registers, and also a match location indicating where in the payload search registers the match occurred.
- Additional search control parameters are provided by the rule processor to search execution hardware 102. Search instructions might provide a mask vector along with a set of bytes comprising the target search pattern. The mask vector might be comprised of bits that correspond to the target pattern byte or bytes.
- specific bytes in the target pattern to be ignored during the search operation are selected by setting the corresponding bits in the mask vector to a pre-determined logic level of 0 or 1.
- the target pattern used in the search may be reduced in size.
- the rule processing instructions may specify starting and ending locations that constitute a search window or a range of bytes in search registers 101 within which the search is constrained.
- Additional parameters to search instructions may include a branch address to be utilized by the rale processor in the event of an unsuccessful search. This feature would enhance the performance of the rule processor when searches of strings of bytes that are significantly longer than the width of the datapath of search execution hardware 102 fail without any matches or fail after matching only the first few bytes with the contents of search registers 101.
- the rale processor can skip over the remaining search instructions for the current string by branching to the instruction that follows the last search instruction for the current string.
- An example of a search instruction is a windowed-find-first-forward instruction.
- a windowed-find-first-forward search given an 8-byte pattern specified in or by a rule, an 8-bit mask, a starting location offset address pointing to a starting byte in the 2KB of content data (e.g., document data) in search registers 101, and an ending location offset address pointing to a ending byte in the 2KB of content data (e.g., document data) in search registers 101, the search returns the starting address (e.g., an 11 bit vector) in search registers 101 of the first string after the specified starting location address that matches the masked pattern, providing this address starts before the ending location offset address.
- the starting address e.g., an 11 bit vector
- a windowed-find-first-reverse search may be performed.
- the search in a windowed-find-first-reverse search, given an 8-byte pattern in the rale, an 8-bit mask, a starting location offset address pointing to a starting byte in the 2KB of content in search registers 101, and an ending location address pointing to a ending byte in the 2KB of content in search registers 101, the search returns the starting address (e.g., an 11 bit vector) of the last string before the specified ending location address that matches the masked pattern, providing this address starts after the starting location offset address.
- the starting address e.g., an 11 bit vector
- the rale processor also provides a control store or rale memory 104 that contains rales or rule sets to be applied to the payload data.
- the memory 104 holds rule sets or sequences of instructions or code that describe patterns, rules, expressions or grammars that need to be applied and detected in search registers 101.
- the rale vocabulary may specify a range of operations, including, but not limited to, global or local (windowed) searches with either exact matches or partial matches, with individual and multiple match information delivered to some registers, primitives to generate offsets and addresses in the output payload of the rule processor, as well as logical and computational operators to be applied to the search results.
- Such rules may be composed of multiple fields that specify the various parameters described above.
- Each parameter may be directly specified within the rule or, alternatively, indirectly specified through the use of a pointer to a register or memory location containing the value to be used.
- each such field may contain an additional sub-field that indicates whether direct or indirect specification is being utilized.
- This apparatus may be specially constructed for the required purposes, or it may comprise a general purpose computer selectively activated or reconfigured by a computer program stored in the computer.
- a computer program may be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.
- a machine-readable medium includes any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computer).
- a machine-readable medium includes read only memory ("ROM”); random access memory (“RAM”); magnetic disk storage media; optical storage media; flash memory devices; electrical, optical, acoustical or other form of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.); etc.
- a rale processing architecture is described for use in a rale processor for content analysis that allows for parallel and recursive sequencing of rales against the content payload.
- the architecture provides for parallel pattern matching capability coupled to the capability of making multiple rapid content-based state transitions.
- the rale processor includes an instruction or rale sequencer for applying rales for execution from a program store on content contained in search registers.
- the rules and the content are consumed by an execution engine that supports a rule vocabulary specifically tailored for one or more operations such as, for example, pattern matching, lexical analysis, parsing and interpretation functions.
- the rule processor performs sequences of prioritized and directed searches of anchored or unanchored patterns and windowed and ranged searches for an arbitrary long pattern starting at any arbitrary location in a document, stream, message, or packet.
- the patterns as well as the range control and program control flow e.g., branch addresses
- branch addresses can be specified statically in rules contained in the program store or dynamically selected indirectly from a register file using a pointer or index set forth in a rale. This enables powerful dynamic and contextual pattern matching.
- the rule processor performs searches using, in part, a specialized pattern matching hardware structure that is coupled to the search registers.
- the rule processor supports rich search, sort, and prioritization functionality.
- rale processing hardware is organized as a four- stage pipeline with a search array and sorter block operating directly on 2Kb of content data (e.g., document data) contained in the search registers. The four stages are: (1) rule fetch from rule memory and rule decode, (2) rale assembly of indirect fields, (3) search execution operations on values in the search registers, and (4) sort operations on the results of the search operations, followed by delivery of results.
- the rule processor presents one or more rales of a search to a search register structure.
- the search register is a 2KB register file with each entry being one byte wide. Data to be searched is loaded in the search register file. Each rale specifies a pattern that is presented to the search register file to determine if the pattern is present in the data stored therein. A mask may also be provided to further configure the pattern and/or to reduce the size of the pattern being used in the search.
- Figure 1 is a block diagram of one embodiment of a rule processor.
- search registers 101 and search execution hardware 102 is collectively presented with a search instruction 103.
- Search instruction 103 is further illustrated in Figure 2 A.
- search instraction 201 comprises an opcode 201a that describes the type of search operation, a search pattern 201b, a mask 201c that specifies the bytes in the pattern that are relevant to the current search instraction and two offsets 20 Id and 20 le that specify the starting and ending bounds, respectively, of the locations in the search register that are relevant to the current search instraction.
- Search execution unit 202 outputs a result 203 that, in one embodiment, is comprised of an indication of the success of the search operation and additionally includes one or more parameters such as, but not limited to, an index that indicates the location within the search register that met the search instruction of the search operation.
- Search execution hardware 202 comprises search register 202a and a sorter 202b as shown in Figure 2A.
- Search register 202a stores searchable data, which may be content from a document, message, packet, or any other well-known source of data that can undergo searching.
- the size of search register 202a may be arbitrary, M bytes, and in one embodiment is organized within a larger array, called a search array 202c, of M rows of N bytes each.
- Data from search register 202a is stored in a replicated manner inside the search array. This embodiment of the search register may be preferred for multiple reasons including better performance for searches on patterns of N contiguous bytes.
- data to be searched is stored in search register
- search register 202a by use of a data generator 213, based on addresses generated from address generator 211, which are decoded by address decoder 212.
- the process of storing also entails recording the size of the searchable data in search register 202a.
- search register 202a provides a mechanism to restrict the search operation to the appropriate data.
- data generator 213 may store a pattern that is established a priori to be data that will be ignored for search operations in the remaining locations of search array 202c or in an alternate embodiment search register 202a disables the appropriate locations of search array 202c from participating in search operations.
- search register 202a may also provide the capability to perform special searches such as case insensitive searches on character data.
- search register 202a may store additional information associated with each byte of searchable data.
- search register 202a may store special bit vectors associated with each searchable data that allows for case insensitive searches or searches for characters belonging to a pre-defined class of characters.
- search array 202c receives a pattern 201b and mask 201c. Pattern 201b is compared against entries in search array 202c.
- search array 202c has M rows of N bytes, where N is the same number of bytes as are in pattern 201b.
- Mask 201c provides an indication of those bytes in pattern 201b that are not part of the pattern being searched. In other words, if pattern 201b is a pattern that is less than N bytes, mask 201c specifies which bytes of pattern 201b search array 202c is to ignore.
- search array 202c has an output line for each of the M rows in search array 202c indicating whether the pattern being searched matched that content data stored in that particular row. In one embodiment, if the output is a 1, the pattern matched content data in the particular row.
- the M output lines of search array 202c are coupled to inputs of sorter 202b.
- Sorter 202b is also coupled to receive offsets 201d and 201e that indicate a starting and ending point, respectively, of a range in search register 202a that is to be searched. In one embodiment, these offsets are log 2 M-bit numbers. Based on the match indication lines from search array 202c and the start and end range as specified by offsets 20 Id and 20 le, sorter 202b processes the results of search array 202c. Such processing may include performing one or more operations. These operations may be index resolution functions that output a specific match index pursuant to the type of operation. In one embodiment, the operations include Find_First_Forward, Find_First_Reverse and Find_Population_Count. The operations are specified by opcode 201a in search instraction 201.
- Sorter 202b may store intermediate or final results of previous operations that may be used in subsequent operations in conjunction with the match indication lines from search array 202c. In this manner, sorter 202b may be used to progressively navigate through the searchable data set by issuing a series of operations that utilize the results of previous operations. Additionally, sorter 202b may also be coupled to a register file for storage of results of previous operations for use in subsequent operations that may be executed after an arbitrary number of other operations have been executed. The results of sorter 202b may also be coupled to the rule processor instruction sequencer, such as instruction sequencer 105 of Figure 1, to generate or assist in the generation of rule program offsets (e.g., branch addresses).
- rule processor instruction sequencer such as instruction sequencer 105 of Figure 1
- sorter 202b After processing, sorter 202b generates outputs indicating whether there is a match, and an index associated with the match.
- the index may indicate the location (address) in search register 202a where the first match occurs or where the last match occurs with respect to the top of search register 202a. Alternatively, the index may indicate the number of matches that occurred within the range specified by offsets.
- the range specified by the offsets may be changed dynamically.
- a first search instraction may be applied to search array 202c initially while a range that is specified by offset 201d and offset 201e comprises all rows of search array 202c.
- the start and end ranges may be changed in a subsequent search instruction such that the searching begins from a location that includes the match lines found within the range specified by the previous search instraction.
- This capability is achieved by using the indirection functionality that allows fields of a rale or an instruction to reference values in a general purpose register file.
- search array 202c is comprised of
- search register 202a holds 2K bytes of data.
- Search array 202c holds replicated data.
- Each 8-byte string that begins with a distinct byte in search register 202a is stored as a distinct row of bytes in search array 202c.
- These strings are comprised of the distinct byte from search register 202a and additionally 7 consecutive bytes that follow that byte in search register 202a.
- each row of search array 202c holds the 7 most significant bytes of the previous row and additionally one immediately succeeding higher order byte, which is appended to the right of these 7 bytes.
- Data is loaded into search array 202c by data generator 213, which, in one embodiment, supplies the appropriate 8 bytes of data for each row from the source data.
- an 8-byte search pattern is presented in each search instraction.
- the search pattern is aligned with search array 202c such that each of the 8 columns in the array is presented with a unique byte.
- Figure 2B state bytes 1 through 8 are stored in the search array for each of rows 1 through 2K.
- the signal for each byte is asserted during a search operation when the stored byte matches the byte of the search pattern that is presented to the same column that the element belongs to.
- 8 signal lines for example 310 ⁇ through 310 18 , are used to indicate each of the byte level matches in the row.
- the byte level matches for each row are ANDed together with the masks from masks 102c in row & mask resolver blocks 311.
- the result of the AND function is an indication of whether a match occurred in each row.
- 2K match lines are output to the sorter.
- the circuit structure of two of the byte elements 312 in this array is shown in Figure 4.
- the circuit operates in a manner that provides a fully parallel search operation by perf orming a simultaneous search within all its rows in one clock period.
- all byte level match lines 401 in a column simultaneously indicate matches with their respective stored bytes.
- a search operation is invoked on all columns simultaneously allowing the masked reduction block in each row to indicate a row level match.
- a parallel search of all 2K strings in the search register that are comprised of 8 contiguous bytes is performed and the results are indicated on the 2K match lines.
- Figure 3A is a block diagram of one embodiment of a sorter.
- match lines 310 from the search array are coupled to and input to a range mask and select unit 301.
- match lines 310 comprise match 1 to match 2048.
- Range mask and select unit 301 receives a pair of offsets specifying a range of rows of the M match lines from search array to perform further processing.
- the offsets are 11 bit numbers that are converted into 2K mask bits that may be ANDed together with the match lines to provide an output.
- Figure 3B Such an example is shown in Figure 3B in which the offset for the start range is converted to one or more zeros with the remainder of the bits being a one bit, while the offset for the end of the range is converted to all zeros starting from the bottom up to a certain point after which all bits are ones.
- index resolution functions unit 302 includes one or more functions that are performed on the outputs of range mask and select unit 301.
- the sorter includes an ascending priority encoder 302A to find the first occurrence (with respect to the top of the search array) of a match between the specified pattern of N bytes and the content data in the search array as indicated by the non-masked match lines.
- a descending priority encoder 302B may also be included to find the last occurrence (with respect to the top of the search array) of a match between the N byte pattern and the content data in the search array as indicated by the non-masked match lines.
- a population counter 302C indicates the number of matches that occur between the N byte pattern and the data in the search array as indicated by the non-masked match lines. Other index selectors may also be used.
- index combine and select unit 303 which is also coupled to receive opcode 102a.
- the opcode 102a is specified in the search instruction and selects one of the index resolution function outputs as the output of the sorter.
- Index combine and select unit 303 generates a match indicator 321 indicating that there was match along with an index 322 indicating that the location within the search array of the data that is either the first occurrence of a match if the output ascending priority encoder 302A is selected, the last occurrence of a match in case the output of descending priority indicator 302B is selected, indicates the number of matches in the non-masked match lines if the pop counter 302C is selected, etc.
- match indicator 321 and index 322 may be utilized to control the execution of one or more search instructions that follow by storing the outputs in general-purpose registers and utilizing indirect specification in subsequent instructions, branching to a specified address in the instraction memory (e.g., instruction memory 104) dependent on the match indicator 321 or other similar techniques.
- Figure 5 illustrates the micro architecture of a rale processor that includes search apparatus.
- the search instructions are stored in an instraction memory 501. Instructions are selected by flow control using an instruction fetch pointer register 502. Instructions are decoded by a decoder 503. The individual subsets of each instruction are either taken from the instruction or fetched from general purpose register file 504. Then the various subsets of each instraction are supplied to the separate units, namely, search array 505, sorter 506 comprising of a sort unit 506a followed by a characterization unit 506b, a conventional arithmetic logic unit (ALU) 507, as set forth above.
- ALU arithmetic logic unit
- the processing of each instruction follows a 4-stage pipeline consisting of (i) instraction fetch stage 508, (ii) an instraction assembly stage 509, (iii) a search/execute stage 510, and (iv) a sort and delivery of results and/or branch stage 511 as described earlier.
- the rule engine instraction format comprises 128- bit rule format. The 128 bits of the rale are divided into subsets that contain various fields to issue directives to various hardware engines on the rule processor.
- the search subset contains a search/sort opcode field (5 bits), a pattern field (in one embodiment, this is 65 bits, containing an 8 byte value or a pointer to a location that provides an 8 byte value along with an additional bit that specifies whether the 8 byte value in the instruction is a pointer or not), a byte level mask field (in one embodiment, 8 bits), a start location address field (in one embodiment this field is 12 bits, comprising an 11 bit value or a pointer to a register that provides an 11 bit value, and including an additional bit to indicate whether the start location address contains the 11 bit value or such a pointer), an end location address field (in one embodiment, this field is 12 bits, comprising an 11 bit value, or a pointer to a register that provides an 11 bit value, with an additional bit to specify whether the end location address information is a pointer or not), a result register field that specifies where the results of the search operations are to be returned (in one embodiment, this field is 6 bits) and a branch address
- Figure 6 illustrates an example pseudo-code 601 of a rule-set that may be processed by one embodiment of the rale processor described above.
- the rale has multiple patterns with some specific constraints on the locations of where such patterns may exist in a message or document or packet. The constraints are expressed in the pseudo-code through the use of key words such as BEFORE and AND. For purposes of simplicity, the patterns in 601 are used in this example without any additional delimiters between strings, which may be the case in practice.
- a listing 602 of the corresponding micro-code for the exemplary rale processor The format of the instructions is as described earlier.
- the first instraction 603 consists of the FIND_FIRST_FORWARD opcode where all 8 bytes of the Pattern "cp /bin/" are relevant for the search (through the use of OxFF as Mask) with the start and end offsets expressed as constant values (through the use of Indirection Flags) to denote the start and end of the searchable payload held in the search registers.
- the derivation of the constant numbers has been skipped here.
- the result of this opcode is shown to be loaded into general purpose register A and lastly the branch address is specified as the constant value of 11 which is the instraction that would follow the micro-code snippet shown in Figure 6.
- This instraction will cause the search execution hardware to search for the occurrence of "cp /bin/" within byte locations 0x03D and 0x800 of the search registers 202a. All rows in the search array 202c that match will assert their respective match lines 310 by the end of the search execution stage 510 of the micro-architectural pipeline.
- the sorter 202b converts 0x03D and 0x800 into bit vectors as illustrated in Figure 3B. The bit vectors are used to perform the range mask and select function 301 to negate any matches that start outside of the location window from 0x03D to 0x800.
- the opcode of this instraction chooses the ascending priority encoder 302a from the index resolution functions 302 to convert the lowest numbered match into an 11 -bit binary encoded location. If such a match was found, match 321 would be asserted and index 322 would hold the 11-bit location. If match 321 were to be not asserted because a match was not found, the instraction sequencer 105 would load the branch address OxB into the instruction pointer 106. Index 322 would be loaded into general- purpose register A by the control circuitry of the register file 504. The load into general-purpose register A and the load of the instraction pointer, if applicable, will be completed by the end of the sort and branch execution stage 511.
- FIND_FORWARD_ANCHORED further illustrates the rich vocabulary of the exemplary rule engine. It is a variant of FIND_FIRST_FORWARD in that the match must begin at the start_offset for the search to be successful.
- Figure 7 illustrates the execution of the micro-code shown in Figure 6 within the micro-architecture of the exemplary rule processor shown in Figure 5.
- Table 701 shows the execution across multiple clock cycles. For purposes of simplicity, it is assumed that all the search instructions are successful in finding the specified patterns in the search registers. The execution proceeds in a pipelined fashion through the 4 stages described in Figure 5. Through the use of indirect specification, the execution of a search instruction can use the offsets calculated in the immediately preceding instraction. Therefore, instructions 1 through 8 are executed in consecutive cycles. Instraction 8 is a branch dependent on the result of the comparison of the contents of general purpose register A and general pu ⁇ ose register B which are computed in clock cycle 8 and clock cycle 9 respectively.
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Computational Linguistics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Logic Circuits (AREA)
- Television Systems (AREA)
- Circuits Of Receivers In General (AREA)
- Image Analysis (AREA)
Abstract
Description
Claims
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2004569774A JP4555088B2 (en) | 2002-08-28 | 2003-08-28 | Programmable rule processor for performing fast context search and characterization of patterns in data |
AU2003272259A AU2003272259A1 (en) | 2002-08-28 | 2003-08-28 | Programmable rule processing apparatus for conducting high speed contextual searches and characterzations of patterns in data |
DE60318722T DE60318722T2 (en) | 2002-08-28 | 2003-08-28 | A PROGRAMMABLE RULE PROCESSING DEVICE FOR HIGH-SPEED CONTEXT SEARCHING AND RECOGNITION OF PATTERNS IN DATA |
EP03754433A EP1535197B1 (en) | 2002-08-28 | 2003-08-28 | Programmable rule processing apparatus for conducting high speed contextual searches characterizations of patterns in data |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US40683402P | 2002-08-28 | 2002-08-28 | |
US60/406,834 | 2002-08-28 | ||
US10/650,363 US7451143B2 (en) | 2002-08-28 | 2003-08-27 | Programmable rule processing apparatus for conducting high speed contextual searches and characterizations of patterns in data |
US10/650,363 | 2003-08-27 |
Publications (2)
Publication Number | Publication Date |
---|---|
WO2004021170A2 true WO2004021170A2 (en) | 2004-03-11 |
WO2004021170A3 WO2004021170A3 (en) | 2004-12-09 |
Family
ID=31997681
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/US2003/027518 WO2004021170A2 (en) | 2002-08-28 | 2003-08-28 | Programmable rule processing apparatus for conducting high speed contextual searches & characterzations of patterns in data |
Country Status (8)
Country | Link |
---|---|
US (1) | US7451143B2 (en) |
EP (1) | EP1535197B1 (en) |
JP (1) | JP4555088B2 (en) |
KR (1) | KR101012623B1 (en) |
AT (1) | ATE384299T1 (en) |
AU (1) | AU2003272259A1 (en) |
DE (1) | DE60318722T2 (en) |
WO (1) | WO2004021170A2 (en) |
Families Citing this family (59)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8479189B2 (en) | 2000-11-17 | 2013-07-02 | Hewlett-Packard Development Company, L.P. | Pattern detection preprocessor in an electronic device update generation system |
US7409685B2 (en) | 2002-04-12 | 2008-08-05 | Hewlett-Packard Development Company, L.P. | Initialization and update of software and/or firmware in electronic devices |
US6986110B1 (en) * | 2003-01-02 | 2006-01-10 | Hewlett-Packard Development Company, L.P. | Automated method and system for backtracing of instruction parameters from specified instruction in test cases |
US7548848B1 (en) | 2003-01-08 | 2009-06-16 | Xambala, Inc. | Method and apparatus for semantic processing engine |
US8555273B1 (en) | 2003-09-17 | 2013-10-08 | Palm. Inc. | Network for updating electronic devices |
US7643826B2 (en) * | 2004-01-07 | 2010-01-05 | Hewlett-Packard Development Company, L.P. | Mobile care engine system |
US7904895B1 (en) | 2004-04-21 | 2011-03-08 | Hewlett-Packard Develpment Company, L.P. | Firmware update in electronic devices employing update agent in a flash memory card |
US8526940B1 (en) | 2004-08-17 | 2013-09-03 | Palm, Inc. | Centralized rules repository for smart phone customer care |
US20060198174A1 (en) * | 2005-02-21 | 2006-09-07 | Yuji Sato | Contents Providing System, Output Control Device, and Output Control Program |
US7710988B1 (en) | 2005-03-11 | 2010-05-04 | Xambala Corporation | Method and system for non-deterministic finite automaton filtering |
US20060215291A1 (en) * | 2005-03-24 | 2006-09-28 | Jaquette Glen A | Data string searching |
JP4581962B2 (en) * | 2005-10-27 | 2010-11-17 | 株式会社日立製作所 | Information retrieval system, index management method and program |
EP2025095A2 (en) | 2006-06-08 | 2009-02-18 | Hewlett-Packard Development Company, L.P. | Device management in a network |
EP2047420A4 (en) | 2006-07-27 | 2009-11-18 | Hewlett Packard Development Co | User experience and dependency management in a mobile device |
TW200821913A (en) * | 2006-11-15 | 2008-05-16 | Univ Nat Chiao Tung | String matching system by using bloom filter to achieve sub-linear computation time and method thereof |
US7743231B2 (en) * | 2007-02-27 | 2010-06-22 | International Business Machines Corporation | Fast sparse list walker |
US7861157B1 (en) * | 2007-03-26 | 2010-12-28 | Lsi Corporation | System and method of processing streaming XML data |
US20090254694A1 (en) * | 2008-04-02 | 2009-10-08 | Zikbit Ltd. | Memory device with integrated parallel processing |
US8676841B2 (en) | 2008-08-29 | 2014-03-18 | Oracle International Corporation | Detection of recurring non-occurrences of events using pattern matching |
KR101276796B1 (en) * | 2008-12-03 | 2013-07-30 | 한국전자통신연구원 | Apparatus and method for matching pattern |
US8145859B2 (en) * | 2009-03-02 | 2012-03-27 | Oracle International Corporation | Method and system for spilling from a queue to a persistent store |
US8387076B2 (en) | 2009-07-21 | 2013-02-26 | Oracle International Corporation | Standardized database connectivity support for an event processing server |
US8321450B2 (en) | 2009-07-21 | 2012-11-27 | Oracle International Corporation | Standardized database connectivity support for an event processing server in an embedded context |
US8527458B2 (en) | 2009-08-03 | 2013-09-03 | Oracle International Corporation | Logging framework for a data stream processing server |
US8386466B2 (en) | 2009-08-03 | 2013-02-26 | Oracle International Corporation | Log visualization tool for a data stream processing server |
US8959106B2 (en) | 2009-12-28 | 2015-02-17 | Oracle International Corporation | Class loading using java data cartridges |
US9430494B2 (en) | 2009-12-28 | 2016-08-30 | Oracle International Corporation | Spatial data cartridge for event processing systems |
US9305057B2 (en) | 2009-12-28 | 2016-04-05 | Oracle International Corporation | Extensible indexing framework using data cartridges |
JP5728932B2 (en) * | 2010-02-09 | 2015-06-03 | 日産自動車株式会社 | Vehicle warning sound generator |
US8713049B2 (en) | 2010-09-17 | 2014-04-29 | Oracle International Corporation | Support for a parameterized query/view in complex event processing |
US9189280B2 (en) | 2010-11-18 | 2015-11-17 | Oracle International Corporation | Tracking large numbers of moving objects in an event processing system |
US9002859B1 (en) | 2010-12-17 | 2015-04-07 | Moonshadow Mobile, Inc. | Systems and methods for high-speed searching and filtering of large datasets |
US8977656B2 (en) | 2011-01-10 | 2015-03-10 | Moonshadow Mobile, Inc. | Inline tree data structure for high-speed searching and filtering of large datasets |
US8639870B2 (en) | 2011-01-14 | 2014-01-28 | Oracle International Corporation | String searching within peripheral storage devices |
US8990416B2 (en) | 2011-05-06 | 2015-03-24 | Oracle International Corporation | Support for a new insert stream (ISTREAM) operation in complex event processing (CEP) |
US9329975B2 (en) | 2011-07-07 | 2016-05-03 | Oracle International Corporation | Continuous query language (CQL) debugger in complex event processing (CEP) |
US9171054B1 (en) | 2012-01-04 | 2015-10-27 | Moonshadow Mobile, Inc. | Systems and methods for high-speed searching and filtering of large datasets |
US8990204B1 (en) | 2012-01-17 | 2015-03-24 | Roy W. Ward | Processing and storage of spatial data |
US9953059B2 (en) | 2012-09-28 | 2018-04-24 | Oracle International Corporation | Generation of archiver queries for continuous queries over archived relations |
US9563663B2 (en) | 2012-09-28 | 2017-02-07 | Oracle International Corporation | Fast path evaluation of Boolean predicates |
US10956422B2 (en) | 2012-12-05 | 2021-03-23 | Oracle International Corporation | Integrating event processing with map-reduce |
US9098587B2 (en) | 2013-01-15 | 2015-08-04 | Oracle International Corporation | Variable duration non-event pattern matching |
US10298444B2 (en) | 2013-01-15 | 2019-05-21 | Oracle International Corporation | Variable duration windows on continuous data streams |
US9047249B2 (en) | 2013-02-19 | 2015-06-02 | Oracle International Corporation | Handling faults in a continuous event processing (CEP) system |
US9390135B2 (en) | 2013-02-19 | 2016-07-12 | Oracle International Corporation | Executing continuous event processing (CEP) queries in parallel |
US9418113B2 (en) | 2013-05-30 | 2016-08-16 | Oracle International Corporation | Value based windows on relations in continuous data streams |
CN104252469B (en) | 2013-06-27 | 2017-10-20 | 国际商业机器公司 | Method, equipment and circuit for pattern match |
US9934279B2 (en) | 2013-12-05 | 2018-04-03 | Oracle International Corporation | Pattern matching across multiple input data streams |
US9244978B2 (en) | 2014-06-11 | 2016-01-26 | Oracle International Corporation | Custom partitioning of a data stream |
US9712645B2 (en) | 2014-06-26 | 2017-07-18 | Oracle International Corporation | Embedded event processing |
US10120907B2 (en) | 2014-09-24 | 2018-11-06 | Oracle International Corporation | Scaling event processing using distributed flows and map-reduce operations |
US9886486B2 (en) | 2014-09-24 | 2018-02-06 | Oracle International Corporation | Enriching events with dynamically typed big data for event processing |
WO2017018901A1 (en) | 2015-07-24 | 2017-02-02 | Oracle International Corporation | Visually exploring and analyzing event streams |
US10282486B2 (en) * | 2015-09-08 | 2019-05-07 | Micron Technology, Inc. | Methods and apparatuses for searching data stored in a memory array using a replicated data pattern |
WO2017135837A1 (en) | 2016-02-01 | 2017-08-10 | Oracle International Corporation | Pattern based automated test data generation |
WO2017135838A1 (en) | 2016-02-01 | 2017-08-10 | Oracle International Corporation | Level of detail control for geostreaming |
US10521411B2 (en) | 2016-08-10 | 2019-12-31 | Moonshadow Mobile, Inc. | Systems, methods, and data structures for high-speed searching or filtering of large datasets |
US10282436B2 (en) * | 2017-01-04 | 2019-05-07 | Samsung Electronics Co., Ltd. | Memory apparatus for in-place regular expression search |
US11379281B2 (en) * | 2020-11-18 | 2022-07-05 | Akamai Technologies, Inc. | Detection and optimization of content in the payloads of API messages |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4760523A (en) * | 1984-06-29 | 1988-07-26 | Trw Inc. | Fast search processor |
US20020087537A1 (en) * | 2000-12-29 | 2002-07-04 | Evans David J. | Method and apparatus for searching a data stream for character patterns |
Family Cites Families (40)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4550436A (en) * | 1983-07-26 | 1985-10-29 | At&T Bell Laboratories | Parallel text matching methods and apparatus |
JPS6244829A (en) * | 1985-08-22 | 1987-02-26 | Matsushita Graphic Commun Syst Inc | Method for extracting pattern |
US5051947A (en) * | 1985-12-10 | 1991-09-24 | Trw Inc. | High-speed single-pass textual search processor for locating exact and inexact matches of a search pattern in a textual stream |
US5060143A (en) * | 1988-08-10 | 1991-10-22 | Bell Communications Research, Inc. | System for string searching including parallel comparison of candidate data block-by-block |
US4965472A (en) | 1988-08-11 | 1990-10-23 | Cypress Semiconductor Corp. | Programmable high speed state machine with sequencing capabilities |
US5050075A (en) * | 1988-10-04 | 1991-09-17 | Bell Communications Research, Inc. | High performance VLSI data filter |
US5452451A (en) | 1989-06-15 | 1995-09-19 | Hitachi, Ltd. | System for plural-string search with a parallel collation of a first partition of each string followed by finite automata matching of second partitions |
US5101376A (en) | 1989-07-31 | 1992-03-31 | Hitachi, Ltd. | Integrated microprocessor with associative memory device |
US5163016A (en) | 1990-03-06 | 1992-11-10 | At&T Bell Laboratories | Analytical development and verification of control-intensive systems |
JPH0535570A (en) * | 1990-05-16 | 1993-02-12 | Internatl Business Mach Corp <Ibm> | Method of searching context of copied data-object |
US5497488A (en) * | 1990-06-12 | 1996-03-05 | Hitachi, Ltd. | System for parallel string search with a function-directed parallel collation of a first partition of each string followed by matching of second partitions |
DE69131272T2 (en) * | 1990-11-13 | 1999-12-09 | International Business Machines Corp., Armonk | Parallel associative processor system |
JP2842712B2 (en) | 1990-11-30 | 1999-01-06 | 大同ほくさん株式会社 | Mounting method |
JPH04315259A (en) * | 1991-04-12 | 1992-11-06 | Nippon Telegr & Teleph Corp <Ntt> | Character string collation processing system |
US5511213A (en) | 1992-05-08 | 1996-04-23 | Correa; Nelson | Associative memory processor architecture for the efficient execution of parsing algorithms for natural language processing and pattern recognition |
JPH06202849A (en) * | 1992-12-28 | 1994-07-22 | Toshiba Corp | Information processor |
JPH07506207A (en) | 1993-02-23 | 1995-07-06 | ゼロックス コーポレイション | String categorization in character recognition |
US5586288A (en) * | 1993-09-22 | 1996-12-17 | Hilevel Technology, Inc. | Memory interface chip with rapid search capability |
US5623680A (en) | 1993-12-28 | 1997-04-22 | Lucent Technologies Inc. | Finite state machine for process control |
US5649149A (en) | 1994-08-01 | 1997-07-15 | Cypress Semiconductor Corporation | Integrated content addressable memory array with processing logical and a host computer interface |
US6070252A (en) | 1994-09-30 | 2000-05-30 | Intel Corporation | Method and apparatus for interactive built-in-self-testing with user-programmable test patterns |
US5905902A (en) | 1995-09-28 | 1999-05-18 | Intel Corporation | Programmable state machine employing a cache-like arrangement |
US5949251A (en) | 1997-08-01 | 1999-09-07 | Vlsi Technology, Inc. | Register-based programmable post-silicon system to patch and dynamically modify the behavior of synchronous state machines |
US6073098A (en) | 1997-11-21 | 2000-06-06 | At&T Corporation | Method and apparatus for generating deterministic approximate weighted finite-state automata |
US5974525A (en) | 1997-12-05 | 1999-10-26 | Intel Corporation | System for allowing multiple instructions to use the same logical registers by remapping them to separate physical segment registers when the first is being utilized |
US6253112B1 (en) | 1998-09-17 | 2001-06-26 | Lucent Technologies Inc. | Method of and apparatus for constructing a complex control system and the complex control system created thereby |
US6380924B1 (en) | 1998-10-22 | 2002-04-30 | Young Yee | Mouse/keyboard capture recorder (MCR) apparatus and methodology |
US6327508B1 (en) | 1998-12-10 | 2001-12-04 | Advanced Micro Devices, Inc. | Programmable state machine |
US6269189B1 (en) * | 1998-12-29 | 2001-07-31 | Xerox Corporation | Finding selected character strings in text and providing information relating to the selected character strings |
US6212625B1 (en) | 1999-05-25 | 2001-04-03 | Advanced Micro Devices, Inc. | General purpose dynamically programmable state engine for executing finite state machines |
JP3700574B2 (en) * | 1999-11-19 | 2005-09-28 | 日本電信電話株式会社 | Search success signal look-ahead output data selection device |
JP4558879B2 (en) | 2000-02-15 | 2010-10-06 | 富士通株式会社 | Data processing apparatus and processing system using table |
US20020194223A1 (en) * | 2000-10-16 | 2002-12-19 | Text Analysis International, Inc. | Computer programming language, system and method for building text analyzers |
US7181386B2 (en) | 2001-11-15 | 2007-02-20 | At&T Corp. | Systems and methods for generating weighted finite-state automata representing grammars |
US20030125931A1 (en) * | 2001-12-07 | 2003-07-03 | Shannon Roy Campbell | Method for matching strings |
US6876559B1 (en) | 2002-02-01 | 2005-04-05 | Netlogic Microsystems, Inc. | Block-writable content addressable memory device |
US6952694B2 (en) | 2002-06-13 | 2005-10-04 | Intel Corporation | Full regular expression search of network traffic |
US7119577B2 (en) | 2002-08-28 | 2006-10-10 | Cisco Systems, Inc. | Method and apparatus for efficient implementation and evaluation of state machines and programmable finite state automata |
US7464254B2 (en) | 2003-01-09 | 2008-12-09 | Cisco Technology, Inc. | Programmable processor apparatus integrating dedicated search registers and dedicated state machine registers with associated execution hardware to support rapid application of rulesets to data |
US7085918B2 (en) | 2003-01-09 | 2006-08-01 | Cisco Systems, Inc. | Methods and apparatuses for evaluation of regular expressions of arbitrary size |
-
2003
- 2003-08-27 US US10/650,363 patent/US7451143B2/en not_active Expired - Fee Related
- 2003-08-28 JP JP2004569774A patent/JP4555088B2/en not_active Expired - Fee Related
- 2003-08-28 DE DE60318722T patent/DE60318722T2/en not_active Expired - Fee Related
- 2003-08-28 AU AU2003272259A patent/AU2003272259A1/en not_active Abandoned
- 2003-08-28 KR KR1020057003602A patent/KR101012623B1/en active IP Right Grant
- 2003-08-28 WO PCT/US2003/027518 patent/WO2004021170A2/en active IP Right Grant
- 2003-08-28 EP EP03754433A patent/EP1535197B1/en not_active Expired - Lifetime
- 2003-08-28 AT AT03754433T patent/ATE384299T1/en not_active IP Right Cessation
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4760523A (en) * | 1984-06-29 | 1988-07-26 | Trw Inc. | Fast search processor |
US20020087537A1 (en) * | 2000-12-29 | 2002-07-04 | Evans David J. | Method and apparatus for searching a data stream for character patterns |
Non-Patent Citations (1)
Title |
---|
MATOBA T: "A RAPID TURNAROUND DESIGN OF A HIGH SPEED VLSI SEARCH PROCESSOR" INTEGRATION, THE VLSI JOURNAL, NORTH-HOLLAND PUBLISHING COMPANY. AMSTERDAM, NL, vol. 10, no. 3, 1 February 1991 (1991-02-01), pages 319-337, XP000219357 ISSN: 0167-9260 * |
Also Published As
Publication number | Publication date |
---|---|
AU2003272259A1 (en) | 2004-03-19 |
WO2004021170A3 (en) | 2004-12-09 |
EP1535197B1 (en) | 2008-01-16 |
DE60318722D1 (en) | 2008-03-06 |
AU2003272259A8 (en) | 2004-03-19 |
KR101012623B1 (en) | 2011-02-09 |
US7451143B2 (en) | 2008-11-11 |
JP4555088B2 (en) | 2010-09-29 |
JP2005537592A (en) | 2005-12-08 |
US20040059725A1 (en) | 2004-03-25 |
ATE384299T1 (en) | 2008-02-15 |
EP1535197A2 (en) | 2005-06-01 |
KR20050050099A (en) | 2005-05-27 |
DE60318722T2 (en) | 2009-01-15 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1535197B1 (en) | Programmable rule processing apparatus for conducting high speed contextual searches characterizations of patterns in data | |
EP1588291B1 (en) | A programmable processor apparatus integrating dedicated search registers and dedicated state machine registers with associated execution hardware to support rapid application of rulesets to data | |
US7119577B2 (en) | Method and apparatus for efficient implementation and evaluation of state machines and programmable finite state automata | |
JP5265378B2 (en) | Method and apparatus for high performance regular expression pattern matching | |
US5488719A (en) | System for categorizing character strings using acceptability and category information contained in ending substrings | |
US7392229B2 (en) | General purpose set theoretic processor | |
US8589405B1 (en) | Token stitcher for a content search system having pipelined engines | |
US20040083466A1 (en) | Hardware parser accelerator | |
US20060259508A1 (en) | Method and apparatus for detecting semantic elements using a push down automaton | |
AU2003277248A1 (en) | Intrusion detection accelerator | |
US20070061884A1 (en) | Intrusion detection accelerator | |
JP2745710B2 (en) | String search method and apparatus therefor | |
CN100483402C (en) | Programmable rule processing apparatus for conducting high speed contextual searches & characterzations of patterns in data | |
US8700593B1 (en) | Content search system having pipelined engines and a token stitcher | |
Lee | ALTEP—A cellular processor for high-speed pattern matching | |
US20170193376A1 (en) | Area/energy complex regular expression pattern matching hardware filter based on truncated deterministic finite automata (dfa) | |
WO1994019757A1 (en) | Categorizing strings in character recognition | |
AU2003277249A1 (en) | Hardware parser accelerator | |
JP2007274051A (en) | Byte sequence searcher and searching method | |
US20020053003A1 (en) | System and method for implementing behavioral operations | |
JPH0195325A (en) | Information processor | |
JPH04245375A (en) | Control system of symbol string collating device |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A2 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ OM PH PL PT RO RU SD SE SG SK SL TJ TM TN TR TT TZ UA UG US UZ VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A2 Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 1020057003602 Country of ref document: KR Ref document number: 2004569774 Country of ref document: JP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2003754433 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 20038244934 Country of ref document: CN |
|
WWP | Wipo information: published in national office |
Ref document number: 1020057003602 Country of ref document: KR |
|
WWP | Wipo information: published in national office |
Ref document number: 2003754433 Country of ref document: EP |
|
WWG | Wipo information: grant in national office |
Ref document number: 2003754433 Country of ref document: EP |