Certain features were missing from the QP trie that would be helpful to have in the future QPDB:
- iterators could only run forward, not backward
- there was no mechanism to retrieve a chain of populated nodes between the root and a searched-for name
- there was no mechanism to retrieve the DNSSEC predecessor of a searched-for name
These have now (I sure hope) been implemented.