3 ms·This cries out to be implemented with Berkeley DB, which is simply much faster than relational databases.by henning 19y agoThis cries out to be implemented with Berkeley DB, which is simply much faster than relational databases.omouse 19y agoI had completely forgotten about BDB, thanks for the reminder!corentin 19y agoI'm not sure it's useful either. Why not just use a dedicated data structure (such as a radix tree dictionary)?