CA2855398C - 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
CA2855398C
CA2855398C CA2855398A CA2855398A CA2855398C CA 2855398 C CA2855398 C CA 2855398C CA 2855398 A CA2855398 A CA 2855398A CA 2855398 A CA2855398 A CA 2855398A CA 2855398 C CA2855398 C CA 2855398C
Authority
CA
Canada
Prior art keywords
string
complex
strings
bit
dictionary
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
CA2855398A
Other languages
English (en)
Other versions
CA2855398A1 (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 CA2873000A priority Critical patent/CA2873000C/fr
Priority to CA2855398A priority patent/CA2855398C/fr
Priority to CA2873011A priority patent/CA2873011C/fr
Publication of CA2855398A1 publication Critical patent/CA2855398A1/fr
Application granted granted Critical
Publication of CA2855398C publication Critical patent/CA2855398C/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
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/33—Querying
    • G06F16/3331—Query processing
    • G06F16/334—Query execution
    • G06F16/3341—Query execution using boolean model

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Databases & Information Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
  • Machine Translation (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.
CA2855398A 2007-02-26 2007-02-26 Identification rapide de chaines complexes dans un flux de donnees Active CA2855398C (fr)

Priority Applications (3)

Application Number Priority Date Filing Date Title
CA2873000A CA2873000C (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
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
CA2579561A CA2579561C (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
CA2579561A Division CA2579561C (fr) 2007-02-26 2007-02-26 Identification rapide de chaines complexes dans un flux de donnees

Related Child Applications (2)

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

Publications (2)

Publication Number Publication Date
CA2855398A1 CA2855398A1 (fr) 2008-08-26
CA2855398C true CA2855398C (fr) 2015-07-14

Family

ID=39718240

Family Applications (4)

Application Number Title Priority Date Filing Date
CA2579561A Active CA2579561C (fr) 2007-02-26 2007-02-26 Identification rapide de chaines complexes dans un flux de donnees
CA2841027A Active CA2841027C (fr) 2007-02-26 2007-02-26 Identification rapide de chaines complexes dans un flux de donnees
CA2855398A Active CA2855398C (fr) 2007-02-26 2007-02-26 Identification rapide de chaines complexes dans un flux de donnees
CA2855382A Active CA2855382C (fr) 2007-02-26 2007-02-26 Identification rapide de chaines complexes dans un flux de donnees

Family Applications Before (2)

Application Number Title Priority Date Filing Date
CA2579561A Active CA2579561C (fr) 2007-02-26 2007-02-26 Identification rapide de chaines complexes dans un flux de donnees
CA2841027A Active CA2841027C (fr) 2007-02-26 2007-02-26 Identification rapide de chaines complexes dans un flux de donnees

Family Applications After (1)

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

Country Status (1)

Country Link
CA (4) CA2579561C (fr)

Also Published As

Publication number Publication date
CA2579561C (fr) 2014-10-07
CA2855382C (fr) 2015-08-25
CA2579561A1 (fr) 2008-08-26
CA2841027C (fr) 2014-10-07
CA2841027A1 (fr) 2008-08-26
CA2855398A1 (fr) 2008-08-26
CA2855382A1 (fr) 2008-08-26

Similar Documents

Publication Publication Date Title
US10169425B2 (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) 語彙辞書の検索範囲を削減するシステム及び方法
KR100414236B1 (ko) 데이터의 검색을 위한 서치 시스템 및 방법
CN102867049A (zh) 一种基于单词查找树实现的汉语拼音快速分词方法
CA2873011C (fr) Identification rapide de chaines complexes dans un flux de donnees
CA2855382C (fr) Identification rapide de chaines complexes dans un flux de donnees
CN108897787B (zh) 基于simd指令的图数据库中集合求交方法和装置
Fujino et al. Discovering unordered and ordered phrase association patterns for text mining
CN107038452A (zh) 电话号码识别方法及装置
Wang et al. Regular expression matching on billion-nodes graphs
Daciuk et al. Gazetteer compression technique based on substructure recognition
Rao et al. String matching problems with parallel approaches-an evaluation for the most recent studies
Peng et al. A fast engine for multi-string pattern matching
JPH1115836A (ja) 文字列探索用テーブル、その作成方法及び文字列探索方法
Shahmohammadi et al. A framework for detecting Holy Quran inside Arabic and Persian texts
Sherriff A TRIE-TREE with sequential filial pointers
Garg Cross Lingual Information Retrieval and Error Tracking in search engine
Arimura et al. Discovering Unordered and Ordered Phrase Association Patterns for Text Mining
NO311657B1 (no) Sökesystem og fremgangsmåte til gjenfinning av data, og bruken derav i en sökemotor

Legal Events

Date Code Title Description
EEER Examination request

Effective date: 20140626

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