Add fast access hash to access data elements by identifier.

The hash has low memory consumption (linear in number of nodes) and
only stores identifier and shared pointer (~8 bytes), but increases
identifier access from O(n) to amortized O(1).