Database raw and crude micro benchmark

Nice to know
1 
          Database raw and crude micro benchmark           
                     1,000,000 entries                     
Database  Operation                              Wall time
--------  ---------                              ---------
nb        1st lookup  .......................... 0.406 secs.
trie      1st lookup  .......................... 0.497 secs.
rec       1st lookup  .......................... 0.614 secs.
consult   1st lookup  .......................... 1.084 secs.
asrt      1st lookup  .......................... 1.087 secs.
hashtable 1st lookup  .......................... 1.612 secs.

nb        2nd lookup  .......................... 0.412 secs.
trie      2nd lookup  .......................... 0.503 secs.
consult   2nd lookup  .......................... 0.581 secs.
asrt      2nd lookup  .......................... 0.589 secs.
rec       2nd lookup  .......................... 0.671 secs.
hashtable 2nd lookup  .......................... 1.585 secs.

nb        insert      .......................... 0.586 secs.
trie      insert      .......................... 0.610 secs.
asrt      insert      .......................... 0.836 secs.
rec       insert      .......................... 1.059 secs.
hashtable insert      .......................... 4.585 secs.
consult   insert      .......................... 21.302 secs.

This was copied from this post by @SWI.

Note: @EricGT copied the post and changed the owner.

2

With the addition of SWI-Prolog redis client, would be nice to see it added to list.

3

Just thinking out loud.

Implemented the Floyd–Warshall algorithm with a variation that can be used to generate all shortest paths in a graph, see: Finding shortest path between any two nodes using Floyd Warshall Algorithm.
Site with interactive visuals for learning Floyd–Warshall algorithm

The reason I noted this is that the algorithm runs in image and just by adding several more nodes and corresponding edges to a graph, this makes for nice distribution points on a timing graph and is a real world algorithm.