Project

General

Profile

Actions

Optimization #548

open

Use bloomfilter for filemd5

Added by David André over 12 years ago. Updated over 1 year ago.

Status:
New
Priority:
Low
Target version:
Effort:
low
Difficulty:
medium
Label:

Description

To reduce memory usage, use bloom filters.

Background:
Bloom filters are very memory efficient probabilistic data-structures that dont have false negatives but have false positives.

Pros:
There is already code implemented in suricata source
It is very efficient for blacklists.

Cons:
It might not be efficient for whitelists.

Notes:
Since it has false positives, it would probably be necessary to do a second level validation lookup from data on disk and it will be more expensive.
Implementing through a different keyword (filemd5bloom?) will help avoiding misuse by users.

Actions #1

Updated by Victor Julien over 12 years ago

I think it could make sense for performance, but not for reducing memory. As you mentioned, after a bloom match you will still need to do a validation step. We can't do that from disk, it would be too slow.

Actions #2

Updated by Victor Julien about 12 years ago

  • Assignee set to Anonymous
  • Target version set to TBD

Performance seems to be OK with the current code as well btw.

Actions #3

Updated by Andreas Herz about 9 years ago

Victor Julien wrote:

Performance seems to be OK with the current code as well btw.

Worth closing the ticket?

Actions #4

Updated by Victor Julien almost 9 years ago

No I changed my mind a bit, think it would be interesting to look into this. Still low priority though.

Actions #5

Updated by Victor Julien over 6 years ago

  • Effort set to low
  • Difficulty set to medium
Actions #6

Updated by Andreas Herz almost 6 years ago

  • Assignee set to Community Ticket
Actions #7

Updated by Philippe Antoine over 1 year ago

  • Tracker changed from Feature to Optimization
Actions

Also available in: Atom PDF