fast — Idiomatic, battle-tested — Built in — Data is copied to caller: keyspace access patterns matter! — Process mailbox can bottleneck reads and writes persistent_term 9
fast — Compilation slows down with data size — Kind of a hack — Updates require recompilation — External library — Data is not copied to caller persistent_term 13
mutable global hash table — Easy, fast — Not GC'd — Built in — Updates are very expensive — Best for few, larger data — Data is not copied to caller persistent_term 15
is not a general replacement for ETS tables. Before using persistent terms, make sure to fully understand the consequence to system performance when updating or deleting persistent terms. — the OTP gods persistent_term 16
in the system will be scheduled to run a scan of their heaps for the term that has been deleted. While such scan is relatively light-weight, if there are many processes, the system can become less responsive until all process have scanned their heaps. — the OTP gods persistent_term 17
easy 1 read perf medium fast fast very fast 1 write perf medium fast very slow very slow many read perf slow fast fast very fast many write perf slow fast very slow very slow builtin? yes yes no yes lookup anything hashtable hashtable hashtable distributed can be no no no persistent_term 24