At ArgoCon today, Thomas Fricke gave a nice talk on Cloud Native
Deployments in Air Gapped
Environments
describing container vulnerability scanning in the German energy
sector… and since he didn’t mention data diodes, and since some of
my colleagues at Oakdoor/PA Consulting make data
diodes for a living, I thought this might be interesting to write
about!
At CentOS Connect yesterday, Jack Aboutboul and Javier Hernandez
presented a talk about AlmaLinux and SBOMs
[video],
where they are exploring a novel supply-chain security effort in the
RHEL ecosystem.
A trie (pronounced either “tree” or “try”)
is a data structure typically used to store a set of strings in a way that
allows looking up by prefix efficiently - i.e. unlike a hashmap where the keys
are randomly ordered - this makes it a reasonable choice for an autocompletion
system. A possible advantage over binary trees is that the keys are not stored
in full in each node - so if you have a large number of strings which often have
overlapping prefixes (e.g. “cat”, “cats”, “catastrophe”) then you may be able to
save memory.