Optimization #6721: hash tables: explore how red black trees compare to linked list in hash buckets - Suricata - Open Information Security Foundation

Actions

Copy link

Optimization #6721

open

hash tables: explore how red black trees compare to linked list in hash buckets

Added by Victor Julien 3 months ago. Updated 3 months ago.

Status:

New

Priority:

Normal

Assignee:

OISF Dev

Target version:

TBD

Effort:

Difficulty:

Label:

Description

From #6720: "Since Java 8, HashMaps use red black trees for hash buckets in case of collisions instead of linked lists and it has been a huge boost to perf. Given that we also use linked lists for the same purpose, it may be interesting to explore how trees would behave in such a situation."

Subtasks 1 (1 open — 0 closed)