Take the tour ×  With focus on read performance, I want to
create a Term such as an Orddict or Proplist that contains a
large number (100,000s) entries, each containing an ID and a
Term value. This encapsulating Term should be able to return the
a value stored under its key, just like an Orddict is able to
do.    K001 - Term001  K002 - Term002  K003 - Term003  The
resulting Term containing the whole set needs to be passed from
function to function, for several computing purposes without
storing it on a persistence store to avoid disk I/O. I also
chose not to use memory caching at this stage to avoid
architectural complexity at this moment, therefore my focus is
to have all of this to be simply key-searcheable.  Orddicts are
key-sorted, which enhance the seek of a key, compared to a
normal Dict. I am not aware of any other Erlang Module that can
embed a more efficient indexing mechanism within its Term.  Any
suggestions for an approach better than an Orddict ?
share|improve this question add comment  2 Answer