Informationsabruf Mithilfe eines Automaten

Details

Veröffentlichungs-Nr.

EP3416068

Aktenzeichen

EP18174343

Anmeldetag

25. Mai 2018

Veröffentlichung

8. Januar 2025

Erteilung

8. Januar 2025

Rechtsraum

EP

IPC

G06F21/55G06F21/56

Abstract

Example techniques herein search a graph data structure and retrieve data associated with a result node or edge. The graph can include nodes representing, e.g., processes or files, and edges between the nodes. A control unit can produce a discrete finite automaton (DFA) based on a query. The control unit can traverse the DFA in conjunction with the graph, beginning at an initial state of the DFA and an entry-point node of the graph, to reach a result node of the graph associated with a triggering state of the DFA. Traversal can include unwinding upon reaching a terminal state of the DFA, in some examples. The control unit can retrieve data associated with the result node or an edge connected there to, and can provide the data via a communications interface. A data-retrieval system can communicate with a data-storage system via the communications interface, in some examples.

Anmelder

Firmen

CrowdStrike, Inc.
Crowdstrike, Inc.

Land

🇺🇸 USA

Fachgebiete