storing big chunks of data
Mon Nov 27 16:36:54 CET 2000
> While we are talking ets... I'm looking at an app which needs to store big
> chunks of data for a short period before forwarding them on. There is a
> choice between some tuple list structure to keep track of several of these
> blobs and dig them out when they need to be sent, or ets.
> Ets involves data copying so is non optimal. Lookup within a keyed tuple
> list is slow for many entries.
> What I need is hashed lookup without data copying of 'tuple lists'..
Try GB trees (http://www.erlang.org/user.html#gb_trees-1.1).
Richard Carlsson (richardc@REDACTED) (This space intentionally left blank.)
E-mail: Richard.Carlsson@REDACTED WWW: http://www.csd.uu.se/~richardc/
More information about the erlang-questions