CA2873011C - Identification rapide de chaines complexes dans un flux de donnees - Google Patents

Identification rapide de chaines complexes dans un flux de donnees Download PDF

Info

Publication number
CA2873011C
CA2873011C CA2873011A CA2873011A CA2873011C CA 2873011 C CA2873011 C CA 2873011C CA 2873011 A CA2873011 A CA 2873011A CA 2873011 A CA2873011 A CA 2873011A CA 2873011 C CA2873011 C CA 2873011C
Authority
CA
Canada
Prior art keywords
string
complex
strings
coherent
data stream
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CA2873011A
Other languages
English (en)
Other versions
CA2873011A1 (fr
Inventor
Kevin Gerard Boyce
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Trend Micro Inc
Original Assignee
Trend Micro Inc
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Trend Micro Inc filed Critical Trend Micro Inc
Priority to CA2873011A priority Critical patent/CA2873011C/fr
Priority claimed from CA2855398A external-priority patent/CA2855398C/fr
Publication of CA2873011A1 publication Critical patent/CA2873011A1/fr
Application granted granted Critical
Publication of CA2873011C publication Critical patent/CA2873011C/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/02—Comparing digital values
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; 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
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F40/00—Handling natural language data
    • G06F40/20—Natural language analysis
    • G06F40/237—Lexical tools
    • G06F40/242—Dictionaries
    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F2207/00—Indexing scheme relating to methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F2207/02—Indexing scheme relating to groups G06F7/02 - G06F7/026
    • G06F2207/025—String search, i.e. pattern matching, e.g. find identical word or best match in a string

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Computational Linguistics (AREA)
  • Databases & Information Systems (AREA)
  • Computational Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Health & Medical Sciences (AREA)
  • Artificial Intelligence (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • General Health & Medical Sciences (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

On décrit une méthode pour la détection et la localisation doccurrences dans un flux de données de toute chaîne complexe qui appartient à un dictionnaire complexe prédéfini. Une chaîne complexe peut comprendre un nombre arbitraire de chaînes cohérentes et de chaînes ambiguës entrelacées. La méthode comprend un premier procédé de transformation du dictionnaire complexe en une structure simple pour permettre de mener continuellement une recherche efficace sur le plan informatique, et un second procédé pour lexamen des données reçues en temps réel à laide de la structure simple. La méthode peut être exécutée par un article de fabrication qui comprend au moins un milieu lisible par un processeur et des instructions sur au moins un support. Les instructions amènent un processeur à apparier les données examinées à une chaîne complexe dobjets qui appartient au dictionnaire complexe, où le processus dappariement est basé sur une égalité aux chaînes cohérentes de constituants, et une congruence aux chaînes ambiguës, de la chaîne complexe dobjets.
CA2873011A 2007-02-26 2007-02-26 Identification rapide de chaines complexes dans un flux de donnees Active CA2873011C (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CA2873011A CA2873011C (fr) 2007-02-26 2007-02-26 Identification rapide de chaines complexes dans un flux de donnees

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CA2873011A CA2873011C (fr) 2007-02-26 2007-02-26 Identification rapide de chaines complexes dans un flux de donnees
CA2855398A CA2855398C (fr) 2007-02-26 2007-02-26 Identification rapide de chaines complexes dans un flux de donnees

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
CA2855398A Division CA2855398C (fr) 2007-02-26 2007-02-26 Identification rapide de chaines complexes dans un flux de donnees

Publications (2)

Publication Number Publication Date
CA2873011A1 CA2873011A1 (fr) 2008-08-26
CA2873011C true CA2873011C (fr) 2016-04-12

Family

ID=52017913

Family Applications (2)

Application Number Title Priority Date Filing Date
CA2873000A Active CA2873000C (fr) 2007-02-26 2007-02-26 Identification rapide de chaines complexes dans un flux de donnees
CA2873011A Active CA2873011C (fr) 2007-02-26 2007-02-26 Identification rapide de chaines complexes dans un flux de donnees

Family Applications Before (1)

Application Number Title Priority Date Filing Date
CA2873000A Active CA2873000C (fr) 2007-02-26 2007-02-26 Identification rapide de chaines complexes dans un flux de donnees

Country Status (1)

Country Link
CA (2) CA2873000C (fr)

Also Published As

Publication number Publication date
CA2873000C (fr) 2016-04-12
CA2873000A1 (fr) 2008-08-26
CA2873011A1 (fr) 2008-08-26

Similar Documents

Publication Publication Date Title
US8423572B2 (en) Fast identification of complex strings in a data stream
Navarro Spaces, trees, and colors: The algorithmic landscape of document retrieval on sequences
JP3077765B2 (ja) 語彙辞書の検索範囲を削減するシステム及び方法
US6373971B1 (en) Method and apparatus for pattern discovery in protein sequences
CN102867049B (zh) 一种基于单词查找树实现的汉语拼音快速分词方法
Chang et al. Applying pattern mining to Web information extraction
CA2873011C (fr) Identification rapide de chaines complexes dans un flux de donnees
CA2855382C (fr) Identification rapide de chaines complexes dans un flux de donnees
Fujino et al. Discovering unordered and ordered phrase association patterns for text mining
CN107038452A (zh) 电话号码识别方法及装置
Daciuk et al. Gazetteer compression technique based on substructure recognition
Peng et al. A fast engine for multi-string pattern matching
Shahmohammadi et al. A framework for detecting Holy Quran inside Arabic and Persian texts
Raeymaekers et al. Sub node extraction with tree based wrappers
Arimura et al. Discovering Unordered and Ordered Phrase Association Patterns for Text Mining
Giegerich et al. E cient implementation of lazy su x trees
Sherriff A TRIE-TREE with sequential filial pointers
JP2004240770A (ja) 仕様変更影響箇所特定方法及び装置及び仕様変更影響箇所特定プログラム

Legal Events

Date Code Title Description
EEER Examination request

Effective date: 20141203

MPN Maintenance fee for patent paid

Free format text: FEE DESCRIPTION TEXT: MF (PATENT, 18TH ANNIV.) - STANDARD

Year of fee payment: 18

U00 Fee paid

Free format text: ST27 STATUS EVENT CODE: A-4-4-U10-U00-U101 (AS PROVIDED BY THE NATIONAL OFFICE); EVENT TEXT: MAINTENANCE REQUEST RECEIVED

Effective date: 20250225

MPN Maintenance fee for patent paid

Free format text: FEE DESCRIPTION TEXT: MF (PATENT, 18TH ANNIV.) - STANDARD

Year of fee payment: 18

U00 Fee paid

Free format text: ST27 STATUS EVENT CODE: A-4-4-U10-U00-U101 (AS PROVIDED BY THE NATIONAL OFFICE); EVENT TEXT: MAINTENANCE REQUEST RECEIVED

Effective date: 20250815

U11 Full renewal or maintenance fee paid

Free format text: ST27 STATUS EVENT CODE: A-4-4-U10-U11-U102 (AS PROVIDED BY THE NATIONAL OFFICE); EVENT TEXT: MAINTENANCE FEE PAYMENT PAID IN FULL

Effective date: 20250815

U11 Full renewal or maintenance fee paid

Free format text: ST27 STATUS EVENT CODE: A-4-4-U10-U11-U102 (AS PROVIDED BY THE NATIONAL OFFICE); EVENT TEXT: MAINTENANCE FEE PAYMENT PAID IN FULL

Effective date: 20251029

W00 Other event occurred

Free format text: ST27 STATUS EVENT CODE: A-4-4-W10-W00-W100 (AS PROVIDED BY THE NATIONAL OFFICE); EVENT TEXT: LETTER SENT

Effective date: 20251103

W00 Other event occurred

Free format text: ST27 STATUS EVENT CODE: A-4-4-W10-W00-W100 (AS PROVIDED BY THE NATIONAL OFFICE); EVENT TEXT: LETTER SENT

Effective date: 20260409